java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:58,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:58,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:58,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:58,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:58,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:58,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:58,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:58,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:58,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:58,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:58,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:58,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:58,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:58,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:58,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:58,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:58,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:58,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:58,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:58,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:58,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:58,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:58,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:59,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:59,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:59,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:59,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:59,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:59,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:59,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:59,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:59,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:59,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:59,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:59,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:59,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:59,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:59,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:59,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:59,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:59,023 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:26:59,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:59,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:59,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:59,060 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:59,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:59,061 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:59,061 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:59,061 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:59,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:59,062 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:59,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:59,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:59,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:59,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:59,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:59,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:59,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:59,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:59,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:59,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:59,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:59,065 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:59,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:59,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:59,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:59,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:59,066 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:59,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:59,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:59,067 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:59,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:59,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:59,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:59,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:59,117 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:59,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c [2019-09-20 13:26:59,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1c88d5/2a87e7808e8c4c829e17fe746dbb0165/FLAG20dd8bb03 [2019-09-20 13:26:59,735 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:59,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-1.c [2019-09-20 13:26:59,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1c88d5/2a87e7808e8c4c829e17fe746dbb0165/FLAG20dd8bb03 [2019-09-20 13:27:00,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1c88d5/2a87e7808e8c4c829e17fe746dbb0165 [2019-09-20 13:27:00,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:00,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:00,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:00,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:00,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:00,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:00" (1/1) ... [2019-09-20 13:27:00,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b1b3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:00, skipping insertion in model container [2019-09-20 13:27:00,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:00" (1/1) ... [2019-09-20 13:27:00,062 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:00,119 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:00,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:00,866 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:01,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:01,061 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:01,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:01 WrapperNode [2019-09-20 13:27:01,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:01,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:01,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:01,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:01,079 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:01" (1/1) ... [2019-09-20 13:27:01,080 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:01" (1/1) ... [2019-09-20 13:27:01,129 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:01" (1/1) ... [2019-09-20 13:27:01,130 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:01" (1/1) ... [2019-09-20 13:27:01,235 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:01" (1/1) ... [2019-09-20 13:27:01,254 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:01" (1/1) ... [2019-09-20 13:27:01,261 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:01" (1/1) ... [2019-09-20 13:27:01,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:01,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:01,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:01,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:01,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:01" (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:01,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:01,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:01,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:01,372 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:01,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:01,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:01,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:01,373 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:01,373 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:01,377 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:01,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:01,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:01,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:01,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:02,197 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:02,950 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:02,950 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:02,982 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:02,983 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:02,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:02 BoogieIcfgContainer [2019-09-20 13:27:02,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:02,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:02,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:02,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:02,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:00" (1/3) ... [2019-09-20 13:27:02,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab57990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:02, skipping insertion in model container [2019-09-20 13:27:02,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:01" (2/3) ... [2019-09-20 13:27:02,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab57990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:02, skipping insertion in model container [2019-09-20 13:27:02,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:02" (3/3) ... [2019-09-20 13:27:02,993 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2019-09-20 13:27:03,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:03,012 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:03,030 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:03,056 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:03,057 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:03,057 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:03,057 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:03,057 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:03,057 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:03,057 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:03,057 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-20 13:27:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:03,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:03,091 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] [2019-09-20 13:27:03,093 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -475475995, now seen corresponding path program 1 times [2019-09-20 13:27:03,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:03,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:03,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,453 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:03,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:03,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:03,477 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-20 13:27:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:03,575 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-20 13:27:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:03,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:03,593 INFO L225 Difference]: With dead ends: 258 [2019-09-20 13:27:03,593 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:03,595 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:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-20 13:27:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-20 13:27:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-20 13:27:03,665 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-20 13:27:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:03,665 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-20 13:27:03,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-20 13:27:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:03,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:03,672 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] [2019-09-20 13:27:03,672 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1406579372, now seen corresponding path program 1 times [2019-09-20 13:27:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,876 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:03,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:03,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:03,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:03,883 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-20 13:27:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:03,985 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-20 13:27:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:03,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:03,989 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:27:03,992 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:27:03,993 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:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:27:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-20 13:27:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-20 13:27:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-20 13:27:04,035 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-20 13:27:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:04,035 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-20 13:27:04,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-20 13:27:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:04,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,040 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:04,040 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1246827421, now seen corresponding path program 1 times [2019-09-20 13:27:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:04,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:04,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:04,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:04,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:04,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:04,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:04,205 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-20 13:27:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:04,804 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-20 13:27:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:04,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:04,811 INFO L225 Difference]: With dead ends: 513 [2019-09-20 13:27:04,811 INFO L226 Difference]: Without dead ends: 513 [2019-09-20 13:27:04,811 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:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-20 13:27:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-20 13:27:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-20 13:27:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-20 13:27:04,848 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-20 13:27:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:04,851 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-20 13:27:04,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-20 13:27:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:04,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,864 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:04,864 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1380840927, now seen corresponding path program 1 times [2019-09-20 13:27:04,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:04,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:04,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:04,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:04,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:04,984 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-20 13:27:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,320 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-20 13:27:05,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:05,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,324 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:05,325 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:05,325 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:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-20 13:27:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-20 13:27:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-20 13:27:05,337 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-20 13:27:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,338 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-20 13:27:05,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-20 13:27:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:05,340 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,340 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:05,340 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1362278, now seen corresponding path program 1 times [2019-09-20 13:27:05,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:05,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:05,432 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-20 13:27:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,898 INFO L93 Difference]: Finished difference Result 545 states and 813 transitions. [2019-09-20 13:27:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:05,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,907 INFO L225 Difference]: With dead ends: 545 [2019-09-20 13:27:05,907 INFO L226 Difference]: Without dead ends: 545 [2019-09-20 13:27:05,908 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:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-20 13:27:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 417. [2019-09-20 13:27:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-20 13:27:05,920 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-20 13:27:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,920 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-20 13:27:05,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-20 13:27:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:05,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,922 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:05,923 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1565875409, now seen corresponding path program 1 times [2019-09-20 13:27:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:06,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:06,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:06,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:06,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:06,008 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-20 13:27:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:06,431 INFO L93 Difference]: Finished difference Result 543 states and 809 transitions. [2019-09-20 13:27:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:06,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:06,435 INFO L225 Difference]: With dead ends: 543 [2019-09-20 13:27:06,436 INFO L226 Difference]: Without dead ends: 543 [2019-09-20 13:27:06,436 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:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-20 13:27:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-20 13:27:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 630 transitions. [2019-09-20 13:27:06,448 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 630 transitions. Word has length 78 [2019-09-20 13:27:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:06,448 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 630 transitions. [2019-09-20 13:27:06,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 630 transitions. [2019-09-20 13:27:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:06,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:06,450 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:06,451 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1584530867, now seen corresponding path program 1 times [2019-09-20 13:27:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:06,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:06,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:06,532 INFO L87 Difference]: Start difference. First operand 417 states and 630 transitions. Second operand 4 states. [2019-09-20 13:27:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,011 INFO L93 Difference]: Finished difference Result 543 states and 807 transitions. [2019-09-20 13:27:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:07,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,015 INFO L225 Difference]: With dead ends: 543 [2019-09-20 13:27:07,015 INFO L226 Difference]: Without dead ends: 543 [2019-09-20 13:27:07,016 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:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-20 13:27:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-20 13:27:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2019-09-20 13:27:07,026 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 78 [2019-09-20 13:27:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,027 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2019-09-20 13:27:07,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2019-09-20 13:27:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:07,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,034 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,034 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2004935792, now seen corresponding path program 1 times [2019-09-20 13:27:07,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:07,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:07,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:07,131 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2019-09-20 13:27:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,560 INFO L93 Difference]: Finished difference Result 543 states and 805 transitions. [2019-09-20 13:27:07,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:07,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,563 INFO L225 Difference]: With dead ends: 543 [2019-09-20 13:27:07,563 INFO L226 Difference]: Without dead ends: 543 [2019-09-20 13:27:07,564 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:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-20 13:27:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-20 13:27:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2019-09-20 13:27:07,574 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 78 [2019-09-20 13:27:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,574 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2019-09-20 13:27:07,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2019-09-20 13:27:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:07,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,576 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,576 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 883724721, now seen corresponding path program 1 times [2019-09-20 13:27:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:07,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:07,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:07,638 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand 4 states. [2019-09-20 13:27:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,906 INFO L93 Difference]: Finished difference Result 459 states and 677 transitions. [2019-09-20 13:27:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:07,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,914 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:07,915 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:07,915 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:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-20 13:27:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 624 transitions. [2019-09-20 13:27:07,925 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 624 transitions. Word has length 78 [2019-09-20 13:27:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,925 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 624 transitions. [2019-09-20 13:27:07,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 624 transitions. [2019-09-20 13:27:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:07,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,927 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:07,928 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,928 INFO L82 PathProgramCache]: Analyzing trace with hash 865069263, now seen corresponding path program 1 times [2019-09-20 13:27:07,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:07,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:07,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:07,994 INFO L87 Difference]: Start difference. First operand 417 states and 624 transitions. Second operand 4 states. [2019-09-20 13:27:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,344 INFO L93 Difference]: Finished difference Result 459 states and 675 transitions. [2019-09-20 13:27:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:08,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,348 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:08,348 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:08,349 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:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-20 13:27:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2019-09-20 13:27:08,362 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 78 [2019-09-20 13:27:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,362 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2019-09-20 13:27:08,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2019-09-20 13:27:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:08,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,364 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:08,365 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash 159568626, now seen corresponding path program 1 times [2019-09-20 13:27:08,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:08,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:08,477 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2019-09-20 13:27:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,775 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-09-20 13:27:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:08,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,779 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:08,779 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:08,780 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:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-20 13:27:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2019-09-20 13:27:08,790 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 78 [2019-09-20 13:27:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,791 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2019-09-20 13:27:08,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2019-09-20 13:27:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:08,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,793 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:08,794 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1402249354, now seen corresponding path program 1 times [2019-09-20 13:27:08,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:08,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:08,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:08,870 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2019-09-20 13:27:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,273 INFO L93 Difference]: Finished difference Result 543 states and 797 transitions. [2019-09-20 13:27:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,276 INFO L225 Difference]: With dead ends: 543 [2019-09-20 13:27:09,277 INFO L226 Difference]: Without dead ends: 543 [2019-09-20 13:27:09,277 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:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-20 13:27:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2019-09-20 13:27:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 618 transitions. [2019-09-20 13:27:09,287 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 618 transitions. Word has length 79 [2019-09-20 13:27:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,287 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 618 transitions. [2019-09-20 13:27:09,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2019-09-20 13:27:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:09,289 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,289 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,289 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 653759193, now seen corresponding path program 1 times [2019-09-20 13:27:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:09,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,352 INFO L87 Difference]: Start difference. First operand 417 states and 618 transitions. Second operand 4 states. [2019-09-20 13:27:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,766 INFO L93 Difference]: Finished difference Result 537 states and 788 transitions. [2019-09-20 13:27:09,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,770 INFO L225 Difference]: With dead ends: 537 [2019-09-20 13:27:09,771 INFO L226 Difference]: Without dead ends: 537 [2019-09-20 13:27:09,771 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:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-20 13:27:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2019-09-20 13:27:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 616 transitions. [2019-09-20 13:27:09,781 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 616 transitions. Word has length 79 [2019-09-20 13:27:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,781 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 616 transitions. [2019-09-20 13:27:09,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 616 transitions. [2019-09-20 13:27:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:09,783 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,783 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1520910644, now seen corresponding path program 1 times [2019-09-20 13:27:09,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,844 INFO L87 Difference]: Start difference. First operand 417 states and 616 transitions. Second operand 4 states. [2019-09-20 13:27:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,134 INFO L93 Difference]: Finished difference Result 459 states and 667 transitions. [2019-09-20 13:27:10,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,137 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:10,138 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:10,138 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:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-09-20 13:27:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 614 transitions. [2019-09-20 13:27:10,147 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 614 transitions. Word has length 79 [2019-09-20 13:27:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,147 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 614 transitions. [2019-09-20 13:27:10,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 614 transitions. [2019-09-20 13:27:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:10,149 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,149 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,149 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash -718048105, now seen corresponding path program 1 times [2019-09-20 13:27:10,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,206 INFO L87 Difference]: Start difference. First operand 417 states and 614 transitions. Second operand 4 states. [2019-09-20 13:27:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,463 INFO L93 Difference]: Finished difference Result 453 states and 658 transitions. [2019-09-20 13:27:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,466 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:10,466 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:10,467 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:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2019-09-20 13:27:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 612 transitions. [2019-09-20 13:27:10,475 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 612 transitions. Word has length 79 [2019-09-20 13:27:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,476 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 612 transitions. [2019-09-20 13:27:10,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 612 transitions. [2019-09-20 13:27:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:10,477 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,478 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,478 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1707509938, now seen corresponding path program 1 times [2019-09-20 13:27:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,535 INFO L87 Difference]: Start difference. First operand 417 states and 612 transitions. Second operand 4 states. [2019-09-20 13:27:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,950 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2019-09-20 13:27:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,954 INFO L225 Difference]: With dead ends: 537 [2019-09-20 13:27:10,955 INFO L226 Difference]: Without dead ends: 537 [2019-09-20 13:27:10,955 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:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-20 13:27:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2019-09-20 13:27:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2019-09-20 13:27:10,969 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 80 [2019-09-20 13:27:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,969 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2019-09-20 13:27:10,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2019-09-20 13:27:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:10,972 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,972 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,972 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2131156660, now seen corresponding path program 1 times [2019-09-20 13:27:10,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,099 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand 4 states. [2019-09-20 13:27:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,383 INFO L93 Difference]: Finished difference Result 453 states and 654 transitions. [2019-09-20 13:27:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,388 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:11,388 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:11,389 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:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2019-09-20 13:27:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 608 transitions. [2019-09-20 13:27:11,397 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 608 transitions. Word has length 80 [2019-09-20 13:27:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,398 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 608 transitions. [2019-09-20 13:27:11,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 608 transitions. [2019-09-20 13:27:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:11,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,399 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,400 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1079799867, now seen corresponding path program 1 times [2019-09-20 13:27:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,455 INFO L87 Difference]: Start difference. First operand 417 states and 608 transitions. Second operand 4 states. [2019-09-20 13:27:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,939 INFO L93 Difference]: Finished difference Result 519 states and 756 transitions. [2019-09-20 13:27:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,944 INFO L225 Difference]: With dead ends: 519 [2019-09-20 13:27:11,944 INFO L226 Difference]: Without dead ends: 519 [2019-09-20 13:27:11,945 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:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-20 13:27:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2019-09-20 13:27:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 606 transitions. [2019-09-20 13:27:11,961 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 606 transitions. Word has length 81 [2019-09-20 13:27:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,962 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 606 transitions. [2019-09-20 13:27:11,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 606 transitions. [2019-09-20 13:27:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:11,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,966 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,966 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash -611627124, now seen corresponding path program 1 times [2019-09-20 13:27:11,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:12,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,055 INFO L87 Difference]: Start difference. First operand 417 states and 606 transitions. Second operand 4 states. [2019-09-20 13:27:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,446 INFO L93 Difference]: Finished difference Result 519 states and 754 transitions. [2019-09-20 13:27:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,451 INFO L225 Difference]: With dead ends: 519 [2019-09-20 13:27:12,451 INFO L226 Difference]: Without dead ends: 519 [2019-09-20 13:27:12,451 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:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-20 13:27:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2019-09-20 13:27:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 604 transitions. [2019-09-20 13:27:12,460 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 604 transitions. Word has length 81 [2019-09-20 13:27:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,460 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 604 transitions. [2019-09-20 13:27:12,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 604 transitions. [2019-09-20 13:27:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:12,462 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,462 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,462 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1327946361, now seen corresponding path program 1 times [2019-09-20 13:27:12,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,517 INFO L87 Difference]: Start difference. First operand 417 states and 604 transitions. Second operand 4 states. [2019-09-20 13:27:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,820 INFO L93 Difference]: Finished difference Result 435 states and 626 transitions. [2019-09-20 13:27:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,824 INFO L225 Difference]: With dead ends: 435 [2019-09-20 13:27:12,824 INFO L226 Difference]: Without dead ends: 435 [2019-09-20 13:27:12,824 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:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-20 13:27:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 417. [2019-09-20 13:27:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 602 transitions. [2019-09-20 13:27:12,833 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 602 transitions. Word has length 81 [2019-09-20 13:27:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,834 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 602 transitions. [2019-09-20 13:27:12,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 602 transitions. [2019-09-20 13:27:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:12,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,836 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,836 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash -363480630, now seen corresponding path program 1 times [2019-09-20 13:27:12,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-20 13:27:12,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:12,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:12,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:12,908 INFO L87 Difference]: Start difference. First operand 417 states and 602 transitions. Second operand 3 states. [2019-09-20 13:27:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,950 INFO L93 Difference]: Finished difference Result 568 states and 821 transitions. [2019-09-20 13:27:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:12,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:27:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,954 INFO L225 Difference]: With dead ends: 568 [2019-09-20 13:27:12,954 INFO L226 Difference]: Without dead ends: 568 [2019-09-20 13:27:12,954 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:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-20 13:27:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-20 13:27:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-20 13:27:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 821 transitions. [2019-09-20 13:27:12,968 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 821 transitions. Word has length 81 [2019-09-20 13:27:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,968 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 821 transitions. [2019-09-20 13:27:12,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 821 transitions. [2019-09-20 13:27:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:12,971 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,971 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,972 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash 891001312, now seen corresponding path program 1 times [2019-09-20 13:27:12,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-20 13:27:13,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:13,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:13,041 INFO L87 Difference]: Start difference. First operand 568 states and 821 transitions. Second operand 3 states. [2019-09-20 13:27:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,079 INFO L93 Difference]: Finished difference Result 719 states and 1041 transitions. [2019-09-20 13:27:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:13,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,083 INFO L225 Difference]: With dead ends: 719 [2019-09-20 13:27:13,083 INFO L226 Difference]: Without dead ends: 719 [2019-09-20 13:27:13,084 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:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-20 13:27:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2019-09-20 13:27:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-20 13:27:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1041 transitions. [2019-09-20 13:27:13,097 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1041 transitions. Word has length 83 [2019-09-20 13:27:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,098 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1041 transitions. [2019-09-20 13:27:13,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1041 transitions. [2019-09-20 13:27:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:13,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,101 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,101 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1251114242, now seen corresponding path program 1 times [2019-09-20 13:27:13,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:13,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:13,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:13,169 INFO L87 Difference]: Start difference. First operand 719 states and 1041 transitions. Second operand 3 states. [2019-09-20 13:27:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,200 INFO L93 Difference]: Finished difference Result 870 states and 1262 transitions. [2019-09-20 13:27:13,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:13,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,205 INFO L225 Difference]: With dead ends: 870 [2019-09-20 13:27:13,205 INFO L226 Difference]: Without dead ends: 870 [2019-09-20 13:27:13,205 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:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-20 13:27:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-09-20 13:27:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-09-20 13:27:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1262 transitions. [2019-09-20 13:27:13,221 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1262 transitions. Word has length 104 [2019-09-20 13:27:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,221 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 1262 transitions. [2019-09-20 13:27:13,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1262 transitions. [2019-09-20 13:27:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:27:13,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,225 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,225 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash -607508183, now seen corresponding path program 1 times [2019-09-20 13:27:13,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:13,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,305 INFO L87 Difference]: Start difference. First operand 870 states and 1262 transitions. Second operand 4 states. [2019-09-20 13:27:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,609 INFO L93 Difference]: Finished difference Result 1181 states and 1719 transitions. [2019-09-20 13:27:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-20 13:27:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,614 INFO L225 Difference]: With dead ends: 1181 [2019-09-20 13:27:13,614 INFO L226 Difference]: Without dead ends: 1181 [2019-09-20 13:27:13,614 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:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-20 13:27:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1014. [2019-09-20 13:27:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-20 13:27:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1514 transitions. [2019-09-20 13:27:13,633 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1514 transitions. Word has length 130 [2019-09-20 13:27:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,634 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1514 transitions. [2019-09-20 13:27:13,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1514 transitions. [2019-09-20 13:27:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:27:13,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,637 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,637 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1842949975, now seen corresponding path program 1 times [2019-09-20 13:27:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:27:13,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,723 INFO L87 Difference]: Start difference. First operand 1014 states and 1514 transitions. Second operand 4 states. [2019-09-20 13:27:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,125 INFO L93 Difference]: Finished difference Result 1175 states and 1707 transitions. [2019-09-20 13:27:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:27:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,134 INFO L225 Difference]: With dead ends: 1175 [2019-09-20 13:27:14,134 INFO L226 Difference]: Without dead ends: 1175 [2019-09-20 13:27:14,134 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:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-20 13:27:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2019-09-20 13:27:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-20 13:27:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1508 transitions. [2019-09-20 13:27:14,164 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1508 transitions. Word has length 145 [2019-09-20 13:27:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,164 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1508 transitions. [2019-09-20 13:27:14,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1508 transitions. [2019-09-20 13:27:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:27:14,169 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,169 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,169 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash 187546869, now seen corresponding path program 1 times [2019-09-20 13:27:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:27:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,290 INFO L87 Difference]: Start difference. First operand 1014 states and 1508 transitions. Second operand 4 states. [2019-09-20 13:27:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,578 INFO L93 Difference]: Finished difference Result 1175 states and 1701 transitions. [2019-09-20 13:27:14,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:27:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,585 INFO L225 Difference]: With dead ends: 1175 [2019-09-20 13:27:14,585 INFO L226 Difference]: Without dead ends: 1175 [2019-09-20 13:27:14,586 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:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-20 13:27:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2019-09-20 13:27:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-20 13:27:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1502 transitions. [2019-09-20 13:27:14,608 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1502 transitions. Word has length 145 [2019-09-20 13:27:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,609 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1502 transitions. [2019-09-20 13:27:14,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1502 transitions. [2019-09-20 13:27:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:27:14,612 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,612 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,613 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1711632728, now seen corresponding path program 1 times [2019-09-20 13:27:14,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-20 13:27:14,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,698 INFO L87 Difference]: Start difference. First operand 1014 states and 1502 transitions. Second operand 4 states. [2019-09-20 13:27:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,973 INFO L93 Difference]: Finished difference Result 1187 states and 1757 transitions. [2019-09-20 13:27:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:27:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,979 INFO L225 Difference]: With dead ends: 1187 [2019-09-20 13:27:14,979 INFO L226 Difference]: Without dead ends: 1187 [2019-09-20 13:27:14,980 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:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-09-20 13:27:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1104. [2019-09-20 13:27:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-20 13:27:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1652 transitions. [2019-09-20 13:27:15,000 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1652 transitions. Word has length 145 [2019-09-20 13:27:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,000 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1652 transitions. [2019-09-20 13:27:15,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1652 transitions. [2019-09-20 13:27:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-20 13:27:15,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,004 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,004 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1539605380, now seen corresponding path program 1 times [2019-09-20 13:27:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:27:15,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,114 INFO L87 Difference]: Start difference. First operand 1104 states and 1652 transitions. Second operand 4 states. [2019-09-20 13:27:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,411 INFO L93 Difference]: Finished difference Result 1265 states and 1845 transitions. [2019-09-20 13:27:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-20 13:27:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,418 INFO L225 Difference]: With dead ends: 1265 [2019-09-20 13:27:15,418 INFO L226 Difference]: Without dead ends: 1265 [2019-09-20 13:27:15,418 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:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-20 13:27:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2019-09-20 13:27:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-20 13:27:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1646 transitions. [2019-09-20 13:27:15,436 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1646 transitions. Word has length 146 [2019-09-20 13:27:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,437 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1646 transitions. [2019-09-20 13:27:15,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1646 transitions. [2019-09-20 13:27:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-20 13:27:15,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,440 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,441 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash -389424422, now seen corresponding path program 1 times [2019-09-20 13:27:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:27:15,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,530 INFO L87 Difference]: Start difference. First operand 1104 states and 1646 transitions. Second operand 4 states. [2019-09-20 13:27:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,830 INFO L93 Difference]: Finished difference Result 1265 states and 1839 transitions. [2019-09-20 13:27:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-20 13:27:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,838 INFO L225 Difference]: With dead ends: 1265 [2019-09-20 13:27:15,838 INFO L226 Difference]: Without dead ends: 1265 [2019-09-20 13:27:15,839 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:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-20 13:27:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2019-09-20 13:27:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-20 13:27:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1640 transitions. [2019-09-20 13:27:15,857 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1640 transitions. Word has length 147 [2019-09-20 13:27:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,858 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1640 transitions. [2019-09-20 13:27:15,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1640 transitions. [2019-09-20 13:27:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-20 13:27:15,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,861 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,861 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -236227263, now seen corresponding path program 1 times [2019-09-20 13:27:15,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:27:15,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,941 INFO L87 Difference]: Start difference. First operand 1104 states and 1640 transitions. Second operand 4 states. [2019-09-20 13:27:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,214 INFO L93 Difference]: Finished difference Result 1211 states and 1767 transitions. [2019-09-20 13:27:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-20 13:27:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,219 INFO L225 Difference]: With dead ends: 1211 [2019-09-20 13:27:16,219 INFO L226 Difference]: Without dead ends: 1211 [2019-09-20 13:27:16,220 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:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-20 13:27:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2019-09-20 13:27:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-20 13:27:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1634 transitions. [2019-09-20 13:27:16,238 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1634 transitions. Word has length 148 [2019-09-20 13:27:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,239 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1634 transitions. [2019-09-20 13:27:16,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1634 transitions. [2019-09-20 13:27:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-20 13:27:16,242 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,243 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,243 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1799915358, now seen corresponding path program 1 times [2019-09-20 13:27:16,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-20 13:27:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:16,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:16,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-20 13:27:16,375 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [144], [149], [152], [280], [283], [291], [294], [299], [302], [304], [310], [313], [315], [317], [319], [324], [327], [335], [337], [339], [342], [350], [355], [357], [360], [369], [372], [380], [385], [387], [522], [556], [558], [570], [589], [595], [596], [597] [2019-09-20 13:27:16,425 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:16,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:16,505 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:27:16,507 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-20 13:27:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,512 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:27:16,613 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:27:16,613 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:27:16,623 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-20 13:27:16,623 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:27:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-20 13:27:16,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:27:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:27:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:16,626 INFO L87 Difference]: Start difference. First operand 1104 states and 1634 transitions. Second operand 2 states. [2019-09-20 13:27:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,627 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:27:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:27:16,627 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 148 [2019-09-20 13:27:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,627 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:27:16,627 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:16,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:16,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2019-09-20 13:27:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,628 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:16,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:27:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:16,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:16,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:16 BoogieIcfgContainer [2019-09-20 13:27:16,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:16,635 INFO L168 Benchmark]: Toolchain (without parser) took 16589.45 ms. Allocated memory was 142.1 MB in the beginning and 405.8 MB in the end (delta: 263.7 MB). Free memory was 87.8 MB in the beginning and 359.0 MB in the end (delta: -271.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:27:16,636 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.0 MB in the beginning and 107.7 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:16,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1015.88 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 87.6 MB in the beginning and 155.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,638 INFO L168 Benchmark]: Boogie Preprocessor took 205.79 ms. Allocated memory is still 199.8 MB. Free memory was 155.2 MB in the beginning and 147.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,639 INFO L168 Benchmark]: RCFGBuilder took 1715.43 ms. Allocated memory was 199.8 MB in the beginning and 229.1 MB in the end (delta: 29.4 MB). Free memory was 147.8 MB in the beginning and 170.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 75.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,639 INFO L168 Benchmark]: TraceAbstraction took 13647.93 ms. Allocated memory was 229.1 MB in the beginning and 405.8 MB in the end (delta: 176.7 MB). Free memory was 170.3 MB in the beginning and 359.0 MB in the end (delta: -188.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:27:16,643 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.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.0 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1015.88 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 87.6 MB in the beginning and 155.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 205.79 ms. Allocated memory is still 199.8 MB. Free memory was 155.2 MB in the beginning and 147.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1715.43 ms. Allocated memory was 199.8 MB in the beginning and 229.1 MB in the end (delta: 29.4 MB). Free memory was 147.8 MB in the beginning and 170.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 75.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13647.93 ms. Allocated memory was 229.1 MB in the beginning and 405.8 MB in the end (delta: 176.7 MB). Free memory was 170.3 MB in the beginning and 359.0 MB in the end (delta: -188.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1646]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. SAFE Result, 13.5s OverallTime, 31 OverallIterations, 7 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6602 SDtfs, 2333 SDslu, 8640 SDs, 0 SdLazy, 4574 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 207 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1104occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.3741496598639455 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 2517 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2843 ConstructedInterpolants, 0 QuantifiedInterpolants, 698053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 3053/3054 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...