/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-a47f07a [2021-04-15 22:54:24,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 22:54:24,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 22:54:24,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 22:54:24,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 22:54:24,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 22:54:24,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 22:54:24,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 22:54:24,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 22:54:24,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 22:54:24,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 22:54:24,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 22:54:24,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 22:54:24,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 22:54:24,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 22:54:24,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 22:54:24,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 22:54:24,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 22:54:24,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 22:54:24,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 22:54:24,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 22:54:24,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 22:54:24,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 22:54:24,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 22:54:24,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 22:54:24,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 22:54:24,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 22:54:24,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 22:54:24,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 22:54:24,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 22:54:24,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 22:54:24,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 22:54:24,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 22:54:24,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 22:54:24,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 22:54:24,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 22:54:24,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 22:54:24,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 22:54:24,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 22:54:24,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 22:54:24,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 22:54:24,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-04-15 22:54:25,024 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 22:54:25,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 22:54:25,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 22:54:25,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 22:54:25,027 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 22:54:25,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 22:54:25,028 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 22:54:25,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 22:54:25,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 22:54:25,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 22:54:25,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 22:54:25,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 22:54:25,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 22:54:25,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 22:54:25,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 22:54:25,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 22:54:25,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 22:54:25,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 22:54:25,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 22:54:25,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 22:54:25,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 22:54:25,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-04-15 22:54:25,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-15 22:54:25,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 22:54:25,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 22:54:25,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 22:54:25,322 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 22:54:25,322 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 22:54:25,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2021-04-15 22:54:25,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6f3b2b1/b71a7bc4960a48d18fab3bc54f96ab3e/FLAG630e3a183 [2021-04-15 22:54:26,199 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 22:54:26,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2021-04-15 22:54:26,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6f3b2b1/b71a7bc4960a48d18fab3bc54f96ab3e/FLAG630e3a183 [2021-04-15 22:54:26,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6f3b2b1/b71a7bc4960a48d18fab3bc54f96ab3e [2021-04-15 22:54:26,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 22:54:26,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-15 22:54:26,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 22:54:26,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 22:54:26,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 22:54:26,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:54:26" (1/1) ... [2021-04-15 22:54:26,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a676dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:26, skipping insertion in model container [2021-04-15 22:54:26,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:54:26" (1/1) ... [2021-04-15 22:54:26,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 22:54:26,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 22:54:26,997 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-04-15 22:54:27,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 22:54:27,018 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 22:54:27,083 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-04-15 22:54:27,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 22:54:27,102 INFO L208 MainTranslator]: Completed translation [2021-04-15 22:54:27,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27 WrapperNode [2021-04-15 22:54:27,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 22:54:27,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 22:54:27,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 22:54:27,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 22:54:27,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (1/1) ... [2021-04-15 22:54:27,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 22:54:27,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 22:54:27,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 22:54:27,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 22:54:27,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (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 [2021-04-15 22:54:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-04-15 22:54:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 22:54:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-04-15 22:54:27,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2021-04-15 22:54:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2021-04-15 22:54:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-04-15 22:54:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2021-04-15 22:54:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2021-04-15 22:54:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-04-15 22:54:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-04-15 22:54:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-04-15 22:54:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-04-15 22:54:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-04-15 22:54:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 22:54:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-04-15 22:54:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2021-04-15 22:54:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-04-15 22:54:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-04-15 22:54:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-04-15 22:54:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-04-15 22:54:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 22:54:27,598 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-04-15 22:54:27,948 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-04-15 22:54:27,949 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-04-15 22:54:27,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 22:54:27,977 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-04-15 22:54:27,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:54:27 BoogieIcfgContainer [2021-04-15 22:54:27,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 22:54:27,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 22:54:27,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 22:54:27,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 22:54:27,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:54:26" (1/3) ... [2021-04-15 22:54:27,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:54:27, skipping insertion in model container [2021-04-15 22:54:27,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:54:27" (2/3) ... [2021-04-15 22:54:27,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:54:27, skipping insertion in model container [2021-04-15 22:54:27,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:54:27" (3/3) ... [2021-04-15 22:54:27,983 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2021-04-15 22:54:27,988 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 22:54:27,992 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-15 22:54:28,003 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-04-15 22:54:28,025 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 22:54:28,025 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 22:54:28,026 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 22:54:28,026 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 22:54:28,026 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 22:54:28,026 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 22:54:28,026 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 22:54:28,026 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 22:54:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-04-15 22:54:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-04-15 22:54:28,047 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:28,047 INFO L519 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] [2021-04-15 22:54:28,048 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2021-04-15 22:54:28,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:28,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249014433] [2021-04-15 22:54:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:28,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:28,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:28,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 22:54:28,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249014433] [2021-04-15 22:54:28,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:28,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 22:54:28,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559673134] [2021-04-15 22:54:28,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 22:54:28,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 22:54:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:28,304 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:28,725 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2021-04-15 22:54:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 22:54:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-04-15 22:54:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:28,735 INFO L225 Difference]: With dead ends: 385 [2021-04-15 22:54:28,736 INFO L226 Difference]: Without dead ends: 223 [2021-04-15 22:54:28,738 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-04-15 22:54:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-04-15 22:54:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2021-04-15 22:54:28,792 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2021-04-15 22:54:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:28,792 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2021-04-15 22:54:28,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2021-04-15 22:54:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-04-15 22:54:28,795 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:28,796 INFO L519 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] [2021-04-15 22:54:28,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 22:54:28,796 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 1 times [2021-04-15 22:54:28,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:28,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844519046] [2021-04-15 22:54:28,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:28,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:28,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:28,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:28,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 22:54:28,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844519046] [2021-04-15 22:54:28,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:28,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 22:54:28,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026998430] [2021-04-15 22:54:28,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 22:54:28,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:28,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 22:54:28,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:28,933 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:29,360 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2021-04-15 22:54:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 22:54:29,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-04-15 22:54:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:29,363 INFO L225 Difference]: With dead ends: 432 [2021-04-15 22:54:29,363 INFO L226 Difference]: Without dead ends: 325 [2021-04-15 22:54:29,364 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-04-15 22:54:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-04-15 22:54:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2021-04-15 22:54:29,377 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2021-04-15 22:54:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:29,377 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2021-04-15 22:54:29,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2021-04-15 22:54:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 22:54:29,384 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:29,384 INFO L519 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] [2021-04-15 22:54:29,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 22:54:29,384 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 1 times [2021-04-15 22:54:29,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:29,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846728595] [2021-04-15 22:54:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:29,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:29,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:29,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:29,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:29,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:29,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:29,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:29,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:29,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846728595] [2021-04-15 22:54:29,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:29,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:29,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897467199] [2021-04-15 22:54:29,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:29,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:29,518 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:30,099 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2021-04-15 22:54:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-04-15 22:54:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:30,102 INFO L225 Difference]: With dead ends: 825 [2021-04-15 22:54:30,102 INFO L226 Difference]: Without dead ends: 513 [2021-04-15 22:54:30,103 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-04-15 22:54:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2021-04-15 22:54:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2021-04-15 22:54:30,119 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2021-04-15 22:54:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:30,119 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2021-04-15 22:54:30,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2021-04-15 22:54:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 22:54:30,120 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:30,120 INFO L519 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] [2021-04-15 22:54:30,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 22:54:30,121 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:30,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 1 times [2021-04-15 22:54:30,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:30,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479775258] [2021-04-15 22:54:30,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:30,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:30,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:30,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:30,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:30,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:30,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479775258] [2021-04-15 22:54:30,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:30,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:30,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527545467] [2021-04-15 22:54:30,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:30,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:30,229 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:30,612 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2021-04-15 22:54:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:30,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-04-15 22:54:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:30,615 INFO L225 Difference]: With dead ends: 821 [2021-04-15 22:54:30,615 INFO L226 Difference]: Without dead ends: 459 [2021-04-15 22:54:30,618 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-04-15 22:54:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2021-04-15 22:54:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2021-04-15 22:54:30,634 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2021-04-15 22:54:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:30,634 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2021-04-15 22:54:30,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2021-04-15 22:54:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 22:54:30,635 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:30,635 INFO L519 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] [2021-04-15 22:54:30,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 22:54:30,635 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:30,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:30,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 1 times [2021-04-15 22:54:30,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:30,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261750092] [2021-04-15 22:54:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:30,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:30,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:30,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:30,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:30,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:30,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:30,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261750092] [2021-04-15 22:54:30,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:30,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:30,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901992598] [2021-04-15 22:54:30,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:30,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:30,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:30,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:30,758 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:31,266 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2021-04-15 22:54:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-04-15 22:54:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:31,268 INFO L225 Difference]: With dead ends: 949 [2021-04-15 22:54:31,268 INFO L226 Difference]: Without dead ends: 547 [2021-04-15 22:54:31,269 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-04-15 22:54:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2021-04-15 22:54:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 412 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2021-04-15 22:54:31,284 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2021-04-15 22:54:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:31,284 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2021-04-15 22:54:31,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2021-04-15 22:54:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 22:54:31,285 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:31,285 INFO L519 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, 1] [2021-04-15 22:54:31,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 22:54:31,285 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 1 times [2021-04-15 22:54:31,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:31,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84934305] [2021-04-15 22:54:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:31,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:31,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:31,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:31,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:31,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:31,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:31,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:31,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:31,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84934305] [2021-04-15 22:54:31,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:31,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:31,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142094133] [2021-04-15 22:54:31,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:31,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:31,390 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:31,933 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2021-04-15 22:54:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-04-15 22:54:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:31,938 INFO L225 Difference]: With dead ends: 951 [2021-04-15 22:54:31,938 INFO L226 Difference]: Without dead ends: 547 [2021-04-15 22:54:31,939 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-04-15 22:54:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2021-04-15 22:54:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5217391304347827) internal successors, (630), 414 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2021-04-15 22:54:31,947 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2021-04-15 22:54:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:31,947 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2021-04-15 22:54:31,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2021-04-15 22:54:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 22:54:31,951 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:31,951 INFO L519 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, 1, 1] [2021-04-15 22:54:31,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 22:54:31,951 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 1 times [2021-04-15 22:54:31,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:31,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540006233] [2021-04-15 22:54:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:31,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:32,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:32,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:32,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:32,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:32,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540006233] [2021-04-15 22:54:32,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:32,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:32,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349837636] [2021-04-15 22:54:32,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:32,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:32,041 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:32,532 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2021-04-15 22:54:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-04-15 22:54:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:32,534 INFO L225 Difference]: With dead ends: 943 [2021-04-15 22:54:32,534 INFO L226 Difference]: Without dead ends: 537 [2021-04-15 22:54:32,535 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-04-15 22:54:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2021-04-15 22:54:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 416 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2021-04-15 22:54:32,551 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2021-04-15 22:54:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:32,551 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2021-04-15 22:54:32,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2021-04-15 22:54:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:32,554 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:32,554 INFO L519 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] [2021-04-15 22:54:32,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 22:54:32,555 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 391550933, now seen corresponding path program 1 times [2021-04-15 22:54:32,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:32,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125165629] [2021-04-15 22:54:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:32,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:32,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:32,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:32,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:32,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:32,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:32,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125165629] [2021-04-15 22:54:32,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:32,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:32,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99171628] [2021-04-15 22:54:32,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:32,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:32,632 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:33,169 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2021-04-15 22:54:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:33,171 INFO L225 Difference]: With dead ends: 943 [2021-04-15 22:54:33,171 INFO L226 Difference]: Without dead ends: 535 [2021-04-15 22:54:33,171 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-04-15 22:54:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-04-15 22:54:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5144230769230769) internal successors, (630), 416 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2021-04-15 22:54:33,179 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2021-04-15 22:54:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2021-04-15 22:54:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2021-04-15 22:54:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:33,180 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:33,180 INFO L519 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] [2021-04-15 22:54:33,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 22:54:33,181 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash -332605162, now seen corresponding path program 1 times [2021-04-15 22:54:33,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:33,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503578799] [2021-04-15 22:54:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:33,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:33,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:33,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:33,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:33,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:33,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503578799] [2021-04-15 22:54:33,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:33,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:33,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694954471] [2021-04-15 22:54:33,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:33,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:33,254 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:33,775 INFO L93 Difference]: Finished difference Result 794 states and 1184 transitions. [2021-04-15 22:54:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:33,778 INFO L225 Difference]: With dead ends: 794 [2021-04-15 22:54:33,778 INFO L226 Difference]: Without dead ends: 535 [2021-04-15 22:54:33,778 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-04-15 22:54:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-04-15 22:54:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5096153846153846) internal successors, (628), 416 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2021-04-15 22:54:33,786 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2021-04-15 22:54:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:33,786 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2021-04-15 22:54:33,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2021-04-15 22:54:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:33,787 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:33,787 INFO L519 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] [2021-04-15 22:54:33,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 22:54:33,787 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 372895475, now seen corresponding path program 1 times [2021-04-15 22:54:33,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:33,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549061890] [2021-04-15 22:54:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:33,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:33,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:33,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:33,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:33,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:33,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:33,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549061890] [2021-04-15 22:54:33,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:33,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:33,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975151944] [2021-04-15 22:54:33,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:33,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:33,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:33,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:33,855 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:34,337 INFO L93 Difference]: Finished difference Result 943 states and 1407 transitions. [2021-04-15 22:54:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:34,340 INFO L225 Difference]: With dead ends: 943 [2021-04-15 22:54:34,340 INFO L226 Difference]: Without dead ends: 535 [2021-04-15 22:54:34,341 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-04-15 22:54:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-04-15 22:54:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5048076923076923) internal successors, (626), 416 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2021-04-15 22:54:34,349 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2021-04-15 22:54:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:34,349 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2021-04-15 22:54:34,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2021-04-15 22:54:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:34,350 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:34,350 INFO L519 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] [2021-04-15 22:54:34,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 22:54:34,350 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1453816233, now seen corresponding path program 1 times [2021-04-15 22:54:34,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:34,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895617447] [2021-04-15 22:54:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:34,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:34,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:34,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:34,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:34,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:34,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895617447] [2021-04-15 22:54:34,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:34,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:34,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686490773] [2021-04-15 22:54:34,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:34,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:34,422 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:34,802 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2021-04-15 22:54:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:34,804 INFO L225 Difference]: With dead ends: 871 [2021-04-15 22:54:34,804 INFO L226 Difference]: Without dead ends: 463 [2021-04-15 22:54:34,805 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-04-15 22:54:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-04-15 22:54:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5) internal successors, (624), 416 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2021-04-15 22:54:34,812 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2021-04-15 22:54:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:34,812 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2021-04-15 22:54:34,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2021-04-15 22:54:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:34,813 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:34,813 INFO L519 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] [2021-04-15 22:54:34,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 22:54:34,813 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2116994968, now seen corresponding path program 1 times [2021-04-15 22:54:34,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:34,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411714420] [2021-04-15 22:54:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:34,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:34,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:34,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:34,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:34,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:34,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:34,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411714420] [2021-04-15 22:54:34,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:34,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:34,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017686377] [2021-04-15 22:54:34,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:34,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:34,885 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:35,254 INFO L93 Difference]: Finished difference Result 722 states and 1068 transitions. [2021-04-15 22:54:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:35,256 INFO L225 Difference]: With dead ends: 722 [2021-04-15 22:54:35,256 INFO L226 Difference]: Without dead ends: 463 [2021-04-15 22:54:35,256 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-04-15 22:54:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-04-15 22:54:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4951923076923077) internal successors, (622), 416 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2021-04-15 22:54:35,264 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2021-04-15 22:54:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:35,264 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2021-04-15 22:54:35,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2021-04-15 22:54:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-04-15 22:54:35,265 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:35,265 INFO L519 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] [2021-04-15 22:54:35,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 22:54:35,265 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1472471691, now seen corresponding path program 1 times [2021-04-15 22:54:35,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:35,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908065547] [2021-04-15 22:54:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:35,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:35,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:35,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:35,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:35,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:35,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908065547] [2021-04-15 22:54:35,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:35,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:35,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880683079] [2021-04-15 22:54:35,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:35,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:35,328 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:35,712 INFO L93 Difference]: Finished difference Result 871 states and 1288 transitions. [2021-04-15 22:54:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-04-15 22:54:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:35,714 INFO L225 Difference]: With dead ends: 871 [2021-04-15 22:54:35,714 INFO L226 Difference]: Without dead ends: 463 [2021-04-15 22:54:35,715 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-04-15 22:54:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-04-15 22:54:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4903846153846154) internal successors, (620), 416 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2021-04-15 22:54:35,725 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2021-04-15 22:54:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:35,725 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2021-04-15 22:54:35,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2021-04-15 22:54:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-15 22:54:35,726 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:35,726 INFO L519 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] [2021-04-15 22:54:35,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 22:54:35,726 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 802013836, now seen corresponding path program 1 times [2021-04-15 22:54:35,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:35,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124846584] [2021-04-15 22:54:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:35,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:35,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:35,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:35,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:35,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:35,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:35,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124846584] [2021-04-15 22:54:35,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:35,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:35,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821315430] [2021-04-15 22:54:35,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:35,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:35,792 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:36,264 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2021-04-15 22:54:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-04-15 22:54:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:36,266 INFO L225 Difference]: With dead ends: 943 [2021-04-15 22:54:36,266 INFO L226 Difference]: Without dead ends: 535 [2021-04-15 22:54:36,267 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-04-15 22:54:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-04-15 22:54:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4855769230769231) internal successors, (618), 416 states have internal predecessors, (618), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-04-15 22:54:36,275 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2021-04-15 22:54:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:36,276 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-04-15 22:54:36,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-04-15 22:54:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-15 22:54:36,277 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:36,277 INFO L519 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] [2021-04-15 22:54:36,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 22:54:36,277 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1436944913, now seen corresponding path program 1 times [2021-04-15 22:54:36,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:36,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775208850] [2021-04-15 22:54:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:36,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:36,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:36,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:36,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:36,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:36,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775208850] [2021-04-15 22:54:36,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:36,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:36,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527083645] [2021-04-15 22:54:36,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:36,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:36,352 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:36,842 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2021-04-15 22:54:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-04-15 22:54:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:36,844 INFO L225 Difference]: With dead ends: 788 [2021-04-15 22:54:36,844 INFO L226 Difference]: Without dead ends: 529 [2021-04-15 22:54:36,844 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-04-15 22:54:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-04-15 22:54:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4807692307692308) internal successors, (616), 416 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2021-04-15 22:54:36,852 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2021-04-15 22:54:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:36,852 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2021-04-15 22:54:36,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2021-04-15 22:54:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-15 22:54:36,853 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:36,853 INFO L519 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] [2021-04-15 22:54:36,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 22:54:36,853 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash -569793462, now seen corresponding path program 1 times [2021-04-15 22:54:36,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:36,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005404490] [2021-04-15 22:54:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:36,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:36,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:36,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:36,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:36,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:36,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:36,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005404490] [2021-04-15 22:54:36,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:36,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:36,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515599624] [2021-04-15 22:54:36,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:36,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:36,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:36,933 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:37,323 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2021-04-15 22:54:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-04-15 22:54:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:37,325 INFO L225 Difference]: With dead ends: 871 [2021-04-15 22:54:37,325 INFO L226 Difference]: Without dead ends: 463 [2021-04-15 22:54:37,326 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-04-15 22:54:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-04-15 22:54:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4759615384615385) internal successors, (614), 416 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2021-04-15 22:54:37,333 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2021-04-15 22:54:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:37,333 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2021-04-15 22:54:37,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2021-04-15 22:54:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-04-15 22:54:37,334 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:37,334 INFO L519 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] [2021-04-15 22:54:37,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 22:54:37,334 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1486215085, now seen corresponding path program 1 times [2021-04-15 22:54:37,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:37,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485239215] [2021-04-15 22:54:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:37,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:37,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:37,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:37,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:37,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:37,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485239215] [2021-04-15 22:54:37,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:37,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:37,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921417837] [2021-04-15 22:54:37,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:37,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:37,394 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:37,726 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2021-04-15 22:54:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-04-15 22:54:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:37,728 INFO L225 Difference]: With dead ends: 716 [2021-04-15 22:54:37,728 INFO L226 Difference]: Without dead ends: 457 [2021-04-15 22:54:37,729 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-04-15 22:54:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-04-15 22:54:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4711538461538463) internal successors, (612), 416 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-04-15 22:54:37,736 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2021-04-15 22:54:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:37,736 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-04-15 22:54:37,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-04-15 22:54:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-04-15 22:54:37,737 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:37,737 INFO L519 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] [2021-04-15 22:54:37,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-15 22:54:37,737 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1321186472, now seen corresponding path program 1 times [2021-04-15 22:54:37,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:37,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984779981] [2021-04-15 22:54:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:37,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:37,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:37,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:37,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:37,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:37,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:37,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984779981] [2021-04-15 22:54:37,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:37,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:37,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988516407] [2021-04-15 22:54:37,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:37,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:37,789 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:38,286 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2021-04-15 22:54:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:38,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-04-15 22:54:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:38,287 INFO L225 Difference]: With dead ends: 937 [2021-04-15 22:54:38,287 INFO L226 Difference]: Without dead ends: 529 [2021-04-15 22:54:38,288 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-04-15 22:54:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-04-15 22:54:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4663461538461537) internal successors, (610), 416 states have internal predecessors, (610), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2021-04-15 22:54:38,296 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2021-04-15 22:54:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:38,296 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2021-04-15 22:54:38,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2021-04-15 22:54:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-04-15 22:54:38,297 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:38,297 INFO L519 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] [2021-04-15 22:54:38,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-15 22:54:38,297 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -897539750, now seen corresponding path program 1 times [2021-04-15 22:54:38,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:38,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140815161] [2021-04-15 22:54:38,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:38,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:38,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:38,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:38,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:38,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:38,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140815161] [2021-04-15 22:54:38,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:38,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:38,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695219668] [2021-04-15 22:54:38,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:38,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:38,359 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:38,689 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2021-04-15 22:54:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-04-15 22:54:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:38,690 INFO L225 Difference]: With dead ends: 865 [2021-04-15 22:54:38,690 INFO L226 Difference]: Without dead ends: 457 [2021-04-15 22:54:38,691 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-04-15 22:54:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-04-15 22:54:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4615384615384615) internal successors, (608), 416 states have internal predecessors, (608), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2021-04-15 22:54:38,698 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2021-04-15 22:54:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:38,698 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2021-04-15 22:54:38,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2021-04-15 22:54:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-04-15 22:54:38,699 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:38,699 INFO L519 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] [2021-04-15 22:54:38,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-15 22:54:38,699 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash -961886895, now seen corresponding path program 1 times [2021-04-15 22:54:38,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:38,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751162182] [2021-04-15 22:54:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:38,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:38,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:38,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:38,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:38,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:38,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:38,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751162182] [2021-04-15 22:54:38,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:38,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:38,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721476850] [2021-04-15 22:54:38,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:38,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:38,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:38,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:38,756 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:39,209 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2021-04-15 22:54:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-04-15 22:54:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:39,211 INFO L225 Difference]: With dead ends: 919 [2021-04-15 22:54:39,211 INFO L226 Difference]: Without dead ends: 511 [2021-04-15 22:54:39,212 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-04-15 22:54:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-04-15 22:54:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4567307692307692) internal successors, (606), 416 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2021-04-15 22:54:39,226 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2021-04-15 22:54:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:39,226 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2021-04-15 22:54:39,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2021-04-15 22:54:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-04-15 22:54:39,227 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:39,227 INFO L519 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] [2021-04-15 22:54:39,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-15 22:54:39,228 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1641653410, now seen corresponding path program 1 times [2021-04-15 22:54:39,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:39,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778658440] [2021-04-15 22:54:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:39,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:39,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:39,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:39,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:39,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:39,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778658440] [2021-04-15 22:54:39,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:39,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:39,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339710198] [2021-04-15 22:54:39,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:39,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:39,278 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:39,702 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2021-04-15 22:54:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:39,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-04-15 22:54:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:39,704 INFO L225 Difference]: With dead ends: 919 [2021-04-15 22:54:39,704 INFO L226 Difference]: Without dead ends: 511 [2021-04-15 22:54:39,705 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-04-15 22:54:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-04-15 22:54:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 416 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2021-04-15 22:54:39,711 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2021-04-15 22:54:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:39,711 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2021-04-15 22:54:39,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2021-04-15 22:54:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-04-15 22:54:39,712 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:39,712 INFO L519 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] [2021-04-15 22:54:39,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-15 22:54:39,713 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash -713740401, now seen corresponding path program 1 times [2021-04-15 22:54:39,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:39,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889908209] [2021-04-15 22:54:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:39,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-15 22:54:39,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:39,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:39,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:39,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:39,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-04-15 22:54:39,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889908209] [2021-04-15 22:54:39,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:39,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:39,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056404807] [2021-04-15 22:54:39,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:39,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:39,767 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:40,079 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2021-04-15 22:54:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-04-15 22:54:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:40,080 INFO L225 Difference]: With dead ends: 847 [2021-04-15 22:54:40,081 INFO L226 Difference]: Without dead ends: 439 [2021-04-15 22:54:40,081 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-04-15 22:54:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2021-04-15 22:54:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4471153846153846) internal successors, (602), 416 states have internal predecessors, (602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2021-04-15 22:54:40,088 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2021-04-15 22:54:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:40,088 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2021-04-15 22:54:40,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2021-04-15 22:54:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-04-15 22:54:40,089 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:40,089 INFO L519 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] [2021-04-15 22:54:40,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-04-15 22:54:40,089 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1889799904, now seen corresponding path program 1 times [2021-04-15 22:54:40,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:40,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694374878] [2021-04-15 22:54:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:40,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-04-15 22:54:40,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694374878] [2021-04-15 22:54:40,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:40,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 22:54:40,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962332823] [2021-04-15 22:54:40,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 22:54:40,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 22:54:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:40,139 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:40,509 INFO L93 Difference]: Finished difference Result 830 states and 1203 transitions. [2021-04-15 22:54:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 22:54:40,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-04-15 22:54:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:40,513 INFO L225 Difference]: With dead ends: 830 [2021-04-15 22:54:40,513 INFO L226 Difference]: Without dead ends: 573 [2021-04-15 22:54:40,513 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-04-15 22:54:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2021-04-15 22:54:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 568 states have (on average 1.4419014084507042) internal successors, (819), 568 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 823 transitions. [2021-04-15 22:54:40,521 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 823 transitions. Word has length 81 [2021-04-15 22:54:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:40,521 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 823 transitions. [2021-04-15 22:54:40,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 823 transitions. [2021-04-15 22:54:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-04-15 22:54:40,522 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:40,522 INFO L519 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] [2021-04-15 22:54:40,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-04-15 22:54:40,522 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1289658122, now seen corresponding path program 1 times [2021-04-15 22:54:40,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:40,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359734325] [2021-04-15 22:54:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:40,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-04-15 22:54:40,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359734325] [2021-04-15 22:54:40,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:40,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 22:54:40,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373046895] [2021-04-15 22:54:40,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 22:54:40,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 22:54:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:40,578 INFO L87 Difference]: Start difference. First operand 573 states and 823 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:40,805 INFO L93 Difference]: Finished difference Result 728 states and 1048 transitions. [2021-04-15 22:54:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 22:54:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-04-15 22:54:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:40,807 INFO L225 Difference]: With dead ends: 728 [2021-04-15 22:54:40,807 INFO L226 Difference]: Without dead ends: 726 [2021-04-15 22:54:40,807 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-04-15 22:54:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2021-04-15 22:54:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 721 states have (on average 1.4438280166435506) internal successors, (1041), 721 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1045 transitions. [2021-04-15 22:54:40,817 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1045 transitions. Word has length 83 [2021-04-15 22:54:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:40,817 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1045 transitions. [2021-04-15 22:54:40,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1045 transitions. [2021-04-15 22:54:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-04-15 22:54:40,818 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:40,818 INFO L519 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] [2021-04-15 22:54:40,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-04-15 22:54:40,818 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash 646584519, now seen corresponding path program 1 times [2021-04-15 22:54:40,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:40,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574946608] [2021-04-15 22:54:40,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:40,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:40,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:40,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:40,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574946608] [2021-04-15 22:54:40,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:40,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 22:54:40,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795383662] [2021-04-15 22:54:40,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 22:54:40,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 22:54:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:40,871 INFO L87 Difference]: Start difference. First operand 726 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:41,251 INFO L93 Difference]: Finished difference Result 1285 states and 1854 transitions. [2021-04-15 22:54:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 22:54:41,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-04-15 22:54:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:41,253 INFO L225 Difference]: With dead ends: 1285 [2021-04-15 22:54:41,253 INFO L226 Difference]: Without dead ends: 723 [2021-04-15 22:54:41,254 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 22:54:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-04-15 22:54:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-04-15 22:54:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 718 states have (on average 1.435933147632312) internal successors, (1031), 718 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1035 transitions. [2021-04-15 22:54:41,263 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1035 transitions. Word has length 104 [2021-04-15 22:54:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:41,263 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 1035 transitions. [2021-04-15 22:54:41,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1035 transitions. [2021-04-15 22:54:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-04-15 22:54:41,265 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:41,265 INFO L519 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, 1, 1] [2021-04-15 22:54:41,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-04-15 22:54:41,265 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1543745982, now seen corresponding path program 1 times [2021-04-15 22:54:41,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:41,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742944832] [2021-04-15 22:54:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:41,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:41,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:41,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:41,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:41,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742944832] [2021-04-15 22:54:41,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:41,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:41,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372492841] [2021-04-15 22:54:41,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:41,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:41,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:41,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:41,325 INFO L87 Difference]: Start difference. First operand 723 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:41,689 INFO L93 Difference]: Finished difference Result 1689 states and 2427 transitions. [2021-04-15 22:54:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2021-04-15 22:54:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:41,691 INFO L225 Difference]: With dead ends: 1689 [2021-04-15 22:54:41,692 INFO L226 Difference]: Without dead ends: 979 [2021-04-15 22:54:41,693 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-04-15 22:54:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-04-15 22:54:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4809069212410502) internal successors, (1241), 838 states have internal predecessors, (1241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1245 transitions. [2021-04-15 22:54:41,704 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1245 transitions. Word has length 106 [2021-04-15 22:54:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:41,705 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1245 transitions. [2021-04-15 22:54:41,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1245 transitions. [2021-04-15 22:54:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-04-15 22:54:41,706 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:41,706 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 22:54:41,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-04-15 22:54:41,706 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash -306215199, now seen corresponding path program 1 times [2021-04-15 22:54:41,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:41,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422563577] [2021-04-15 22:54:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:41,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:41,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:41,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:41,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:41,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:41,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422563577] [2021-04-15 22:54:41,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:41,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:41,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101216571] [2021-04-15 22:54:41,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:41,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:41,764 INFO L87 Difference]: Start difference. First operand 843 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:42,137 INFO L93 Difference]: Finished difference Result 1804 states and 2627 transitions. [2021-04-15 22:54:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:42,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-04-15 22:54:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:42,140 INFO L225 Difference]: With dead ends: 1804 [2021-04-15 22:54:42,140 INFO L226 Difference]: Without dead ends: 974 [2021-04-15 22:54:42,141 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-04-15 22:54:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-04-15 22:54:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4749403341288783) internal successors, (1236), 838 states have internal predecessors, (1236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1240 transitions. [2021-04-15 22:54:42,152 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1240 transitions. Word has length 121 [2021-04-15 22:54:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:42,152 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1240 transitions. [2021-04-15 22:54:42,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1240 transitions. [2021-04-15 22:54:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-04-15 22:54:42,154 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:42,154 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 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] [2021-04-15 22:54:42,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-04-15 22:54:42,154 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -435520542, now seen corresponding path program 1 times [2021-04-15 22:54:42,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:42,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943547890] [2021-04-15 22:54:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:42,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:42,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:42,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:42,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-04-15 22:54:42,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943547890] [2021-04-15 22:54:42,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:42,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:42,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269186390] [2021-04-15 22:54:42,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:42,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:42,232 INFO L87 Difference]: Start difference. First operand 843 states and 1240 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:42,595 INFO L93 Difference]: Finished difference Result 1636 states and 2410 transitions. [2021-04-15 22:54:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-04-15 22:54:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:42,598 INFO L225 Difference]: With dead ends: 1636 [2021-04-15 22:54:42,598 INFO L226 Difference]: Without dead ends: 981 [2021-04-15 22:54:42,599 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-04-15 22:54:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-04-15 22:54:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4901098901098901) internal successors, (1356), 910 states have internal predecessors, (1356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1360 transitions. [2021-04-15 22:54:42,613 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1360 transitions. Word has length 121 [2021-04-15 22:54:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:42,613 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1360 transitions. [2021-04-15 22:54:42,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1360 transitions. [2021-04-15 22:54:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-04-15 22:54:42,614 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:42,615 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 22:54:42,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-04-15 22:54:42,615 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1054241153, now seen corresponding path program 1 times [2021-04-15 22:54:42,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:42,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236402432] [2021-04-15 22:54:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:42,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:42,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:42,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:42,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:42,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:42,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236402432] [2021-04-15 22:54:42,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:42,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:42,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685219036] [2021-04-15 22:54:42,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:42,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:42,675 INFO L87 Difference]: Start difference. First operand 915 states and 1360 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:43,118 INFO L93 Difference]: Finished difference Result 1948 states and 2857 transitions. [2021-04-15 22:54:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-04-15 22:54:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:43,121 INFO L225 Difference]: With dead ends: 1948 [2021-04-15 22:54:43,121 INFO L226 Difference]: Without dead ends: 1046 [2021-04-15 22:54:43,122 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-04-15 22:54:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-04-15 22:54:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4846153846153847) internal successors, (1351), 910 states have internal predecessors, (1351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1355 transitions. [2021-04-15 22:54:43,142 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1355 transitions. Word has length 121 [2021-04-15 22:54:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:43,143 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1355 transitions. [2021-04-15 22:54:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1355 transitions. [2021-04-15 22:54:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-04-15 22:54:43,144 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:43,145 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 22:54:43,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-04-15 22:54:43,146 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1412102102, now seen corresponding path program 1 times [2021-04-15 22:54:43,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:43,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013046364] [2021-04-15 22:54:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:43,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:43,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:43,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:43,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:43,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013046364] [2021-04-15 22:54:43,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:43,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:43,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466511168] [2021-04-15 22:54:43,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:43,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:43,205 INFO L87 Difference]: Start difference. First operand 915 states and 1355 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:43,589 INFO L93 Difference]: Finished difference Result 1948 states and 2847 transitions. [2021-04-15 22:54:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:43,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-04-15 22:54:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:43,592 INFO L225 Difference]: With dead ends: 1948 [2021-04-15 22:54:43,592 INFO L226 Difference]: Without dead ends: 1046 [2021-04-15 22:54:43,593 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-04-15 22:54:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-04-15 22:54:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4791208791208792) internal successors, (1346), 910 states have internal predecessors, (1346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1350 transitions. [2021-04-15 22:54:43,606 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1350 transitions. Word has length 122 [2021-04-15 22:54:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:43,606 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1350 transitions. [2021-04-15 22:54:43,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1350 transitions. [2021-04-15 22:54:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-04-15 22:54:43,608 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:43,608 INFO L519 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-04-15 22:54:43,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-04-15 22:54:43,608 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1769118364, now seen corresponding path program 1 times [2021-04-15 22:54:43,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:43,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868036843] [2021-04-15 22:54:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:43,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:43,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:43,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:43,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:43,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:43,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868036843] [2021-04-15 22:54:43,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:43,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:43,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395111332] [2021-04-15 22:54:43,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:43,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:43,669 INFO L87 Difference]: Start difference. First operand 915 states and 1350 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:44,048 INFO L93 Difference]: Finished difference Result 1948 states and 2837 transitions. [2021-04-15 22:54:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-04-15 22:54:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:44,051 INFO L225 Difference]: With dead ends: 1948 [2021-04-15 22:54:44,051 INFO L226 Difference]: Without dead ends: 1046 [2021-04-15 22:54:44,052 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-04-15 22:54:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-04-15 22:54:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4736263736263737) internal successors, (1341), 910 states have internal predecessors, (1341), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1345 transitions. [2021-04-15 22:54:44,064 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1345 transitions. Word has length 123 [2021-04-15 22:54:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:44,064 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1345 transitions. [2021-04-15 22:54:44,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1345 transitions. [2021-04-15 22:54:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-04-15 22:54:44,065 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:44,065 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 22:54:44,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-04-15 22:54:44,065 INFO L428 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 363812251, now seen corresponding path program 1 times [2021-04-15 22:54:44,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:44,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518690394] [2021-04-15 22:54:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:44,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:44,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:44,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:44,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-04-15 22:54:44,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518690394] [2021-04-15 22:54:44,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:44,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:44,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419645294] [2021-04-15 22:54:44,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:44,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:44,133 INFO L87 Difference]: Start difference. First operand 915 states and 1345 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:44,469 INFO L93 Difference]: Finished difference Result 1903 states and 2772 transitions. [2021-04-15 22:54:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2021-04-15 22:54:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:44,472 INFO L225 Difference]: With dead ends: 1903 [2021-04-15 22:54:44,472 INFO L226 Difference]: Without dead ends: 1001 [2021-04-15 22:54:44,473 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-04-15 22:54:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 915. [2021-04-15 22:54:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.468131868131868) internal successors, (1336), 910 states have internal predecessors, (1336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1340 transitions. [2021-04-15 22:54:44,484 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1340 transitions. Word has length 124 [2021-04-15 22:54:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:44,484 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1340 transitions. [2021-04-15 22:54:44,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1340 transitions. [2021-04-15 22:54:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-04-15 22:54:44,486 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:44,486 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2021-04-15 22:54:44,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-04-15 22:54:44,486 INFO L428 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1599888212, now seen corresponding path program 1 times [2021-04-15 22:54:44,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:44,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914672042] [2021-04-15 22:54:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:44,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-15 22:54:44,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:44,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:44,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:44,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-04-15 22:54:44,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914672042] [2021-04-15 22:54:44,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:44,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-15 22:54:44,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342999767] [2021-04-15 22:54:44,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-15 22:54:44,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-15 22:54:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-15 22:54:44,542 INFO L87 Difference]: Start difference. First operand 915 states and 1340 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:44,915 INFO L93 Difference]: Finished difference Result 2048 states and 3002 transitions. [2021-04-15 22:54:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-15 22:54:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2021-04-15 22:54:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:44,918 INFO L225 Difference]: With dead ends: 2048 [2021-04-15 22:54:44,918 INFO L226 Difference]: Without dead ends: 1146 [2021-04-15 22:54:44,919 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-15 22:54:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-04-15 22:54:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-04-15 22:54:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.496078431372549) internal successors, (1526), 1020 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1530 transitions. [2021-04-15 22:54:44,932 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1530 transitions. Word has length 124 [2021-04-15 22:54:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:44,932 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1530 transitions. [2021-04-15 22:54:44,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1530 transitions. [2021-04-15 22:54:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-04-15 22:54:44,933 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:44,933 INFO L519 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] [2021-04-15 22:54:44,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-04-15 22:54:44,934 INFO L428 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1834894398, now seen corresponding path program 1 times [2021-04-15 22:54:44,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:44,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732694173] [2021-04-15 22:54:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:45,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:45,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:45,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:45,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:45,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:45,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-15 22:54:45,031 INFO L142 QuantifierPusher]: treesize reduction 11, result has 76.1 percent of original size [2021-04-15 22:54:45,032 INFO L147 QuantifierPusher]: treesize reduction 6, result has 82.9 percent of original size 29 [2021-04-15 22:54:45,050 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-04-15 22:54:45,050 INFO L147 QuantifierPusher]: treesize reduction 6, result has 72.7 percent of original size 16 [2021-04-15 22:54:45,057 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-04-15 22:54:45,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-15 22:54:45,063 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-04-15 22:54:45,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:45,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:45,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:45,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-15 22:54:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 22:54:45,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-15 22:54:45,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-15 22:54:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-04-15 22:54:45,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732694173] [2021-04-15 22:54:45,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 22:54:45,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 22:54:45,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062171361] [2021-04-15 22:54:45,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 22:54:45,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 22:54:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 22:54:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-04-15 22:54:45,097 INFO L87 Difference]: Start difference. First operand 1025 states and 1530 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 22:54:45,488 INFO L93 Difference]: Finished difference Result 2041 states and 3048 transitions. [2021-04-15 22:54:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-15 22:54:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-04-15 22:54:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 22:54:45,491 INFO L225 Difference]: With dead ends: 2041 [2021-04-15 22:54:45,491 INFO L226 Difference]: Without dead ends: 1029 [2021-04-15 22:54:45,492 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 22:54:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-04-15 22:54:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2021-04-15 22:54:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1023 states have (on average 1.4946236559139785) internal successors, (1529), 1023 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1533 transitions. [2021-04-15 22:54:45,506 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1533 transitions. Word has length 128 [2021-04-15 22:54:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 22:54:45,507 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1533 transitions. [2021-04-15 22:54:45,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-04-15 22:54:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1533 transitions. [2021-04-15 22:54:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-04-15 22:54:45,509 INFO L511 BasicCegarLoop]: Found error trace [2021-04-15 22:54:45,509 INFO L519 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] [2021-04-15 22:54:45,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-04-15 22:54:45,509 INFO L428 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 22:54:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 22:54:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2021-04-15 22:54:45,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 22:54:45,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59028226] [2021-04-15 22:54:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 22:54:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 22:54:45,600 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 22:54:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 22:54:45,697 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 22:54:45,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 22:54:45,754 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 22:54:45,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-04-15 22:54:45,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:54:45 BoogieIcfgContainer [2021-04-15 22:54:45,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 22:54:45,876 INFO L168 Benchmark]: Toolchain (without parser) took 19215.23 ms. Allocated memory was 230.7 MB in the beginning and 423.6 MB in the end (delta: 192.9 MB). Free memory was 193.2 MB in the beginning and 189.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 196.8 MB. Max. memory is 8.0 GB. [2021-04-15 22:54:45,876 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 230.7 MB. Free memory is still 212.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-04-15 22:54:45,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.47 ms. Allocated memory is still 230.7 MB. Free memory was 193.1 MB in the beginning and 197.7 MB in the end (delta: -4.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-04-15 22:54:45,876 INFO L168 Benchmark]: Boogie Preprocessor took 113.77 ms. Allocated memory is still 230.7 MB. Free memory was 197.7 MB in the beginning and 190.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-04-15 22:54:45,876 INFO L168 Benchmark]: RCFGBuilder took 760.26 ms. Allocated memory is still 230.7 MB. Free memory was 190.7 MB in the beginning and 139.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 50.8 MB. Max. memory is 8.0 GB. [2021-04-15 22:54:45,876 INFO L168 Benchmark]: TraceAbstraction took 17892.26 ms. Allocated memory was 230.7 MB in the beginning and 423.6 MB in the end (delta: 192.9 MB). Free memory was 139.2 MB in the beginning and 189.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 8.0 GB. [2021-04-15 22:54:45,877 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 230.7 MB. Free memory is still 212.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 444.47 ms. Allocated memory is still 230.7 MB. Free memory was 193.1 MB in the beginning and 197.7 MB in the end (delta: -4.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 113.77 ms. Allocated memory is still 230.7 MB. Free memory was 197.7 MB in the beginning and 190.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 760.26 ms. Allocated memory is still 230.7 MB. Free memory was 190.7 MB in the beginning and 139.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 50.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17892.26 ms. Allocated memory was 230.7 MB in the beginning and 423.6 MB in the end (delta: 192.9 MB). Free memory was 139.2 MB in the beginning and 189.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1647]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1332. Possible FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967355, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={8:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1073] CALL ssl3_connect(s) VAL [init=1, s={-3:0}, SSLv3_client_data={8:0}] [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->info_callback={0:-4294967295}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=12292, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] EXPR s->version VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->version=-2, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->init_buf={13:-12}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->bbio={17:-14}, s->wbio={-13:15}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->hit=0, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1328] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-4294967295}, ((s->s3)->tmp.new_cipher)->algorithms=4294967314, (s->s3)->tmp.new_cipher={4294967354:18}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1341] COND FALSE !(ret <= 0) VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1647] reach_error() VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17731.4ms, OverallIterations: 35, TraceHistogramMax: 7, EmptinessCheckTime: 50.3ms, AutomataDifference: 14267.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7619 SDtfs, 2645 SDslu, 9889 SDs, 0 SdLazy, 14293 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10524.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 103 SyntacticMatches, 21 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1049.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=34, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 390.0ms AutomataMinimizationTime, 34 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 135.2ms SsaConstructionTime, 495.0ms SatisfiabilityAnalysisTime, 1980.2ms InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 8810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...