java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:16,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:16,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:16,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:16,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:16,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:16,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:16,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:16,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:16,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:16,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:16,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:16,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:16,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:16,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:16,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:16,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:16,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:16,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:16,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:16,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:16,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:16,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:16,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:16,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:16,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:16,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:16,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:16,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:16,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:16,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:16,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:16,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:16,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:16,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:16,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:16,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:16,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:16,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:16,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:16,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:16,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:05:16,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:16,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:16,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:16,123 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:16,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:16,124 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:16,124 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:16,125 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:16,125 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:16,125 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:16,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:16,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:16,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:16,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:16,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:16,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:16,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:16,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:16,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:16,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:16,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:16,129 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:16,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:16,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:16,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:16,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:16,131 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:16,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:16,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:16,131 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:16,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:16,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:16,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:16,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:16,216 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:16,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c [2019-09-16 17:05:16,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862e532bc/c45a9ad13c634050bbc7bd7265605d35/FLAG6aa32da06 [2019-09-16 17:05:16,900 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:16,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c [2019-09-16 17:05:16,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862e532bc/c45a9ad13c634050bbc7bd7265605d35/FLAG6aa32da06 [2019-09-16 17:05:17,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862e532bc/c45a9ad13c634050bbc7bd7265605d35 [2019-09-16 17:05:17,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:17,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:17,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:17,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:17,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:17,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:17" (1/1) ... [2019-09-16 17:05:17,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee14b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:17, skipping insertion in model container [2019-09-16 17:05:17,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:17" (1/1) ... [2019-09-16 17:05:17,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:17,188 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:17,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:17,840 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:18,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:18,047 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:18,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18 WrapperNode [2019-09-16 17:05:18,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:18,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:18,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:18,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:18,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... [2019-09-16 17:05:18,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:18,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:18,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:18,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:18,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:18,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:18,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:18,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:18,255 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:18,257 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:18,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:18,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:18,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:18,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:18,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:18,733 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:19,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:19,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:19,611 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:19,612 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:19,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:19 BoogieIcfgContainer [2019-09-16 17:05:19,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:19,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:19,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:19,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:19,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:17" (1/3) ... [2019-09-16 17:05:19,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7414292b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:19, skipping insertion in model container [2019-09-16 17:05:19,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:18" (2/3) ... [2019-09-16 17:05:19,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7414292b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:19, skipping insertion in model container [2019-09-16 17:05:19,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:19" (3/3) ... [2019-09-16 17:05:19,622 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-09-16 17:05:19,633 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:19,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:19,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:19,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:19,698 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:19,699 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:19,699 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:19,699 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:19,699 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:19,699 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:19,699 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-09-16 17:05:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 17:05:19,743 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:19,744 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:19,746 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -883272509, now seen corresponding path program 1 times [2019-09-16 17:05:19,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:20,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:20,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:20,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:20,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:20,178 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2019-09-16 17:05:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:20,665 INFO L93 Difference]: Finished difference Result 202 states and 334 transitions. [2019-09-16 17:05:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:20,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-16 17:05:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:20,685 INFO L225 Difference]: With dead ends: 202 [2019-09-16 17:05:20,685 INFO L226 Difference]: Without dead ends: 181 [2019-09-16 17:05:20,689 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-16 17:05:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-16 17:05:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-16 17:05:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 256 transitions. [2019-09-16 17:05:20,752 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 256 transitions. Word has length 51 [2019-09-16 17:05:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:20,753 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 256 transitions. [2019-09-16 17:05:20,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 256 transitions. [2019-09-16 17:05:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:20,757 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:20,757 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:20,757 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2034174241, now seen corresponding path program 1 times [2019-09-16 17:05:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:20,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:20,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:20,961 INFO L87 Difference]: Start difference. First operand 164 states and 256 transitions. Second operand 4 states. [2019-09-16 17:05:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:21,383 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2019-09-16 17:05:21,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:21,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:21,386 INFO L225 Difference]: With dead ends: 181 [2019-09-16 17:05:21,386 INFO L226 Difference]: Without dead ends: 181 [2019-09-16 17:05:21,387 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-16 17:05:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-16 17:05:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-16 17:05:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2019-09-16 17:05:21,400 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 64 [2019-09-16 17:05:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:21,400 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2019-09-16 17:05:21,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2019-09-16 17:05:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:21,403 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:21,404 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:21,404 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1818184895, now seen corresponding path program 1 times [2019-09-16 17:05:21,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:21,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:21,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:21,513 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand 4 states. [2019-09-16 17:05:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:21,835 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2019-09-16 17:05:21,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:21,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:21,837 INFO L225 Difference]: With dead ends: 180 [2019-09-16 17:05:21,838 INFO L226 Difference]: Without dead ends: 180 [2019-09-16 17:05:21,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-16 17:05:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2019-09-16 17:05:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-16 17:05:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 254 transitions. [2019-09-16 17:05:21,849 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 254 transitions. Word has length 65 [2019-09-16 17:05:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:21,850 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 254 transitions. [2019-09-16 17:05:21,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 254 transitions. [2019-09-16 17:05:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:21,852 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:21,853 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:21,853 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1638771629, now seen corresponding path program 1 times [2019-09-16 17:05:21,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:21,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:21,946 INFO L87 Difference]: Start difference. First operand 164 states and 254 transitions. Second operand 5 states. [2019-09-16 17:05:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,461 INFO L93 Difference]: Finished difference Result 185 states and 282 transitions. [2019-09-16 17:05:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:22,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-16 17:05:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,464 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:22,464 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:22,465 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-16 17:05:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 281 transitions. [2019-09-16 17:05:22,475 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 281 transitions. Word has length 65 [2019-09-16 17:05:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,476 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 281 transitions. [2019-09-16 17:05:22,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 281 transitions. [2019-09-16 17:05:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:22,478 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,479 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:22,479 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash 936595467, now seen corresponding path program 1 times [2019-09-16 17:05:22,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:22,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:22,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:22,576 INFO L87 Difference]: Start difference. First operand 184 states and 281 transitions. Second operand 4 states. [2019-09-16 17:05:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,888 INFO L93 Difference]: Finished difference Result 199 states and 298 transitions. [2019-09-16 17:05:22,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:22,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,891 INFO L225 Difference]: With dead ends: 199 [2019-09-16 17:05:22,891 INFO L226 Difference]: Without dead ends: 199 [2019-09-16 17:05:22,892 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-16 17:05:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2019-09-16 17:05:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-09-16 17:05:22,900 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 65 [2019-09-16 17:05:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,901 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-09-16 17:05:22,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-09-16 17:05:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:22,903 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,903 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:22,903 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash 435943946, now seen corresponding path program 1 times [2019-09-16 17:05:22,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:22,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:22,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:22,976 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 4 states. [2019-09-16 17:05:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,234 INFO L93 Difference]: Finished difference Result 197 states and 295 transitions. [2019-09-16 17:05:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,236 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:23,236 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:23,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-16 17:05:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 279 transitions. [2019-09-16 17:05:23,243 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 279 transitions. Word has length 65 [2019-09-16 17:05:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,244 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 279 transitions. [2019-09-16 17:05:23,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 279 transitions. [2019-09-16 17:05:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:05:23,245 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,245 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:23,246 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash -601039716, now seen corresponding path program 1 times [2019-09-16 17:05:23,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,305 INFO L87 Difference]: Start difference. First operand 184 states and 279 transitions. Second operand 4 states. [2019-09-16 17:05:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,583 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2019-09-16 17:05:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:05:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,585 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:23,586 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:23,586 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-16 17:05:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2019-09-16 17:05:23,592 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 66 [2019-09-16 17:05:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2019-09-16 17:05:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2019-09-16 17:05:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:05:23,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,594 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:23,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2091511225, now seen corresponding path program 1 times [2019-09-16 17:05:23,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,701 INFO L87 Difference]: Start difference. First operand 184 states and 278 transitions. Second operand 4 states. [2019-09-16 17:05:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,970 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2019-09-16 17:05:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:05:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,972 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:23,972 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:23,973 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-16 17:05:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2019-09-16 17:05:23,979 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 67 [2019-09-16 17:05:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,980 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2019-09-16 17:05:23,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2019-09-16 17:05:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-16 17:05:23,981 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,981 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:23,982 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2040778903, now seen corresponding path program 1 times [2019-09-16 17:05:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:24,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,038 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand 4 states. [2019-09-16 17:05:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,306 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:05:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-16 17:05:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,308 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:24,308 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:24,308 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-16 17:05:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:05:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 276 transitions. [2019-09-16 17:05:24,316 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 276 transitions. Word has length 68 [2019-09-16 17:05:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,317 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 276 transitions. [2019-09-16 17:05:24,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 276 transitions. [2019-09-16 17:05:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-16 17:05:24,326 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,327 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:24,327 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1393046730, now seen corresponding path program 1 times [2019-09-16 17:05:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,388 INFO L87 Difference]: Start difference. First operand 184 states and 276 transitions. Second operand 4 states. [2019-09-16 17:05:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,692 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2019-09-16 17:05:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-16 17:05:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,695 INFO L225 Difference]: With dead ends: 226 [2019-09-16 17:05:24,696 INFO L226 Difference]: Without dead ends: 226 [2019-09-16 17:05:24,696 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-16 17:05:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-16 17:05:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2019-09-16 17:05:24,703 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 68 [2019-09-16 17:05:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,703 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2019-09-16 17:05:24,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2019-09-16 17:05:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-16 17:05:24,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,705 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:24,705 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 90053346, now seen corresponding path program 1 times [2019-09-16 17:05:24,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,779 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand 4 states. [2019-09-16 17:05:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,043 INFO L93 Difference]: Finished difference Result 209 states and 316 transitions. [2019-09-16 17:05:25,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-16 17:05:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,047 INFO L225 Difference]: With dead ends: 209 [2019-09-16 17:05:25,047 INFO L226 Difference]: Without dead ends: 209 [2019-09-16 17:05:25,047 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-16 17:05:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-16 17:05:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 312 transitions. [2019-09-16 17:05:25,060 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 312 transitions. Word has length 69 [2019-09-16 17:05:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,060 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 312 transitions. [2019-09-16 17:05:25,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 312 transitions. [2019-09-16 17:05:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:25,062 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,062 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,062 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1646996660, now seen corresponding path program 1 times [2019-09-16 17:05:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:25,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,171 INFO L87 Difference]: Start difference. First operand 206 states and 312 transitions. Second operand 4 states. [2019-09-16 17:05:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,451 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2019-09-16 17:05:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,458 INFO L225 Difference]: With dead ends: 226 [2019-09-16 17:05:25,458 INFO L226 Difference]: Without dead ends: 226 [2019-09-16 17:05:25,459 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-16 17:05:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-16 17:05:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2019-09-16 17:05:25,465 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 81 [2019-09-16 17:05:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,465 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2019-09-16 17:05:25,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2019-09-16 17:05:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:05:25,467 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,467 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,467 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 54198590, now seen corresponding path program 1 times [2019-09-16 17:05:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:25,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,530 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand 4 states. [2019-09-16 17:05:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,853 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2019-09-16 17:05:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:05:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,855 INFO L225 Difference]: With dead ends: 225 [2019-09-16 17:05:25,855 INFO L226 Difference]: Without dead ends: 225 [2019-09-16 17:05:25,856 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-16 17:05:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2019-09-16 17:05:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2019-09-16 17:05:25,863 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 82 [2019-09-16 17:05:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,863 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2019-09-16 17:05:25,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2019-09-16 17:05:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:05:25,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,865 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,865 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash -446452931, now seen corresponding path program 1 times [2019-09-16 17:05:25,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:25,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,930 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand 4 states. [2019-09-16 17:05:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,231 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2019-09-16 17:05:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:05:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,233 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:05:26,233 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:05:26,234 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:05:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-16 17:05:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 309 transitions. [2019-09-16 17:05:26,239 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 309 transitions. Word has length 82 [2019-09-16 17:05:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,240 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 309 transitions. [2019-09-16 17:05:26,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 309 transitions. [2019-09-16 17:05:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:26,241 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,241 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:26,242 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2109428169, now seen corresponding path program 1 times [2019-09-16 17:05:26,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:26,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,319 INFO L87 Difference]: Start difference. First operand 206 states and 309 transitions. Second operand 4 states. [2019-09-16 17:05:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,591 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2019-09-16 17:05:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:05:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,594 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:05:26,594 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:05:26,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:05:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-16 17:05:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2019-09-16 17:05:26,600 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 83 [2019-09-16 17:05:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,601 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2019-09-16 17:05:26,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2019-09-16 17:05:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-16 17:05:26,602 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,602 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:26,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,603 INFO L82 PathProgramCache]: Analyzing trace with hash 328614586, now seen corresponding path program 1 times [2019-09-16 17:05:26,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:26,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,688 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand 4 states. [2019-09-16 17:05:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,038 INFO L93 Difference]: Finished difference Result 223 states and 329 transitions. [2019-09-16 17:05:27,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-16 17:05:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,041 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:05:27,041 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:05:27,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:05:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-16 17:05:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 307 transitions. [2019-09-16 17:05:27,050 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 307 transitions. Word has length 84 [2019-09-16 17:05:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,051 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 307 transitions. [2019-09-16 17:05:27,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 307 transitions. [2019-09-16 17:05:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-16 17:05:27,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,053 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:27,054 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash -244732284, now seen corresponding path program 1 times [2019-09-16 17:05:27,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,135 INFO L87 Difference]: Start difference. First operand 206 states and 307 transitions. Second operand 4 states. [2019-09-16 17:05:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,407 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2019-09-16 17:05:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-16 17:05:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,409 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:05:27,410 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:05:27,410 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:05:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-16 17:05:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 306 transitions. [2019-09-16 17:05:27,416 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 306 transitions. Word has length 85 [2019-09-16 17:05:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,416 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 306 transitions. [2019-09-16 17:05:27,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 306 transitions. [2019-09-16 17:05:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-16 17:05:27,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,417 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:27,418 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2041316715, now seen corresponding path program 1 times [2019-09-16 17:05:27,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,488 INFO L87 Difference]: Start difference. First operand 206 states and 306 transitions. Second operand 4 states. [2019-09-16 17:05:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,824 INFO L93 Difference]: Finished difference Result 213 states and 315 transitions. [2019-09-16 17:05:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-16 17:05:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,827 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:05:27,827 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:05:27,827 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:05:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2019-09-16 17:05:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-16 17:05:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 305 transitions. [2019-09-16 17:05:27,833 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 305 transitions. Word has length 86 [2019-09-16 17:05:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,833 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 305 transitions. [2019-09-16 17:05:27,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 305 transitions. [2019-09-16 17:05:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:05:27,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,835 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:27,836 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1423979757, now seen corresponding path program 1 times [2019-09-16 17:05:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,942 INFO L87 Difference]: Start difference. First operand 206 states and 305 transitions. Second operand 4 states. [2019-09-16 17:05:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,450 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-09-16 17:05:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:05:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,453 INFO L225 Difference]: With dead ends: 321 [2019-09-16 17:05:28,453 INFO L226 Difference]: Without dead ends: 321 [2019-09-16 17:05:28,454 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-16 17:05:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-09-16 17:05:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-16 17:05:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 378 transitions. [2019-09-16 17:05:28,463 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 378 transitions. Word has length 90 [2019-09-16 17:05:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,464 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 378 transitions. [2019-09-16 17:05:28,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 378 transitions. [2019-09-16 17:05:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:05:28,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,466 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:28,466 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 526586479, now seen corresponding path program 1 times [2019-09-16 17:05:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:28,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,562 INFO L87 Difference]: Start difference. First operand 247 states and 378 transitions. Second operand 4 states. [2019-09-16 17:05:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,963 INFO L93 Difference]: Finished difference Result 296 states and 451 transitions. [2019-09-16 17:05:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:05:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,966 INFO L225 Difference]: With dead ends: 296 [2019-09-16 17:05:28,966 INFO L226 Difference]: Without dead ends: 296 [2019-09-16 17:05:28,966 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-16 17:05:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-16 17:05:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-16 17:05:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2019-09-16 17:05:28,974 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 90 [2019-09-16 17:05:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,975 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2019-09-16 17:05:28,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2019-09-16 17:05:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:05:28,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,977 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:28,977 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1255891959, now seen corresponding path program 1 times [2019-09-16 17:05:28,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:29,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,096 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand 4 states. [2019-09-16 17:05:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,503 INFO L93 Difference]: Finished difference Result 335 states and 509 transitions. [2019-09-16 17:05:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-16 17:05:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,505 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:05:29,506 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:05:29,506 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:05:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-16 17:05:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2019-09-16 17:05:29,514 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 91 [2019-09-16 17:05:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,514 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2019-09-16 17:05:29,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2019-09-16 17:05:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:29,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,516 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:29,516 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2083138293, now seen corresponding path program 1 times [2019-09-16 17:05:29,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:29,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,584 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand 4 states. [2019-09-16 17:05:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,038 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2019-09-16 17:05:30,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,043 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:05:30,043 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:05:30,043 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:05:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-16 17:05:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2019-09-16 17:05:30,050 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 419 transitions. Word has length 103 [2019-09-16 17:05:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,051 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 419 transitions. [2019-09-16 17:05:30,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 419 transitions. [2019-09-16 17:05:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:30,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,053 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:30,053 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2123813043, now seen corresponding path program 1 times [2019-09-16 17:05:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:30,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,142 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. Second operand 4 states. [2019-09-16 17:05:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,510 INFO L93 Difference]: Finished difference Result 297 states and 450 transitions. [2019-09-16 17:05:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,512 INFO L225 Difference]: With dead ends: 297 [2019-09-16 17:05:30,512 INFO L226 Difference]: Without dead ends: 297 [2019-09-16 17:05:30,512 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-16 17:05:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 272. [2019-09-16 17:05:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 418 transitions. [2019-09-16 17:05:30,520 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 418 transitions. Word has length 103 [2019-09-16 17:05:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,520 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 418 transitions. [2019-09-16 17:05:30,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 418 transitions. [2019-09-16 17:05:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:30,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,522 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:30,522 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash -275734859, now seen corresponding path program 1 times [2019-09-16 17:05:30,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:30,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,595 INFO L87 Difference]: Start difference. First operand 272 states and 418 transitions. Second operand 4 states. [2019-09-16 17:05:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,005 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-09-16 17:05:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,007 INFO L225 Difference]: With dead ends: 334 [2019-09-16 17:05:31,008 INFO L226 Difference]: Without dead ends: 334 [2019-09-16 17:05:31,008 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-16 17:05:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 272. [2019-09-16 17:05:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 417 transitions. [2019-09-16 17:05:31,016 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 417 transitions. Word has length 104 [2019-09-16 17:05:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,017 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 417 transitions. [2019-09-16 17:05:31,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 417 transitions. [2019-09-16 17:05:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:31,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,019 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:31,019 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash -776386380, now seen corresponding path program 1 times [2019-09-16 17:05:31,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:31,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,128 INFO L87 Difference]: Start difference. First operand 272 states and 417 transitions. Second operand 4 states. [2019-09-16 17:05:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,521 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2019-09-16 17:05:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,523 INFO L225 Difference]: With dead ends: 332 [2019-09-16 17:05:31,524 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 17:05:31,524 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 17:05:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-16 17:05:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 416 transitions. [2019-09-16 17:05:31,532 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 416 transitions. Word has length 104 [2019-09-16 17:05:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,532 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 416 transitions. [2019-09-16 17:05:31,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 416 transitions. [2019-09-16 17:05:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:31,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,534 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:31,534 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,534 INFO L82 PathProgramCache]: Analyzing trace with hash 985182391, now seen corresponding path program 1 times [2019-09-16 17:05:31,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:31,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,609 INFO L87 Difference]: Start difference. First operand 272 states and 416 transitions. Second operand 4 states. [2019-09-16 17:05:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,939 INFO L93 Difference]: Finished difference Result 296 states and 446 transitions. [2019-09-16 17:05:31,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,942 INFO L225 Difference]: With dead ends: 296 [2019-09-16 17:05:31,942 INFO L226 Difference]: Without dead ends: 296 [2019-09-16 17:05:31,942 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-16 17:05:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2019-09-16 17:05:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 415 transitions. [2019-09-16 17:05:31,949 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 415 transitions. Word has length 104 [2019-09-16 17:05:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,949 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 415 transitions. [2019-09-16 17:05:31,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2019-09-16 17:05:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:31,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,951 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:31,951 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 484530870, now seen corresponding path program 1 times [2019-09-16 17:05:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:32,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,033 INFO L87 Difference]: Start difference. First operand 272 states and 415 transitions. Second operand 4 states. [2019-09-16 17:05:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,414 INFO L93 Difference]: Finished difference Result 294 states and 443 transitions. [2019-09-16 17:05:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,416 INFO L225 Difference]: With dead ends: 294 [2019-09-16 17:05:32,417 INFO L226 Difference]: Without dead ends: 294 [2019-09-16 17:05:32,417 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-16 17:05:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-16 17:05:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 414 transitions. [2019-09-16 17:05:32,425 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 414 transitions. Word has length 104 [2019-09-16 17:05:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,426 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 414 transitions. [2019-09-16 17:05:32,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 414 transitions. [2019-09-16 17:05:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:32,428 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,429 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,429 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 471425842, now seen corresponding path program 1 times [2019-09-16 17:05:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:32,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,517 INFO L87 Difference]: Start difference. First operand 272 states and 414 transitions. Second operand 4 states. [2019-09-16 17:05:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,908 INFO L93 Difference]: Finished difference Result 332 states and 499 transitions. [2019-09-16 17:05:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,910 INFO L225 Difference]: With dead ends: 332 [2019-09-16 17:05:32,910 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 17:05:32,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 17:05:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-16 17:05:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2019-09-16 17:05:32,918 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 105 [2019-09-16 17:05:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,918 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2019-09-16 17:05:32,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2019-09-16 17:05:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:32,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,920 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,920 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 905154928, now seen corresponding path program 1 times [2019-09-16 17:05:32,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:32,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,977 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand 4 states. [2019-09-16 17:05:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,295 INFO L93 Difference]: Finished difference Result 294 states and 441 transitions. [2019-09-16 17:05:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,298 INFO L225 Difference]: With dead ends: 294 [2019-09-16 17:05:33,298 INFO L226 Difference]: Without dead ends: 294 [2019-09-16 17:05:33,299 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-16 17:05:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-16 17:05:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2019-09-16 17:05:33,311 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 105 [2019-09-16 17:05:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,311 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2019-09-16 17:05:33,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2019-09-16 17:05:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:05:33,313 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,313 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:33,313 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1090150001, now seen corresponding path program 1 times [2019-09-16 17:05:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:33,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,411 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 4 states. [2019-09-16 17:05:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,850 INFO L93 Difference]: Finished difference Result 332 states and 497 transitions. [2019-09-16 17:05:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:05:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,854 INFO L225 Difference]: With dead ends: 332 [2019-09-16 17:05:33,854 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 17:05:33,855 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 17:05:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-16 17:05:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 411 transitions. [2019-09-16 17:05:33,862 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 411 transitions. Word has length 106 [2019-09-16 17:05:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,862 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 411 transitions. [2019-09-16 17:05:33,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2019-09-16 17:05:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:05:33,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,864 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:33,864 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1650849779, now seen corresponding path program 1 times [2019-09-16 17:05:33,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:33,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,934 INFO L87 Difference]: Start difference. First operand 272 states and 411 transitions. Second operand 4 states. [2019-09-16 17:05:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,211 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2019-09-16 17:05:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:05:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,217 INFO L225 Difference]: With dead ends: 294 [2019-09-16 17:05:34,218 INFO L226 Difference]: Without dead ends: 294 [2019-09-16 17:05:34,218 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-16 17:05:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-16 17:05:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2019-09-16 17:05:34,224 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 106 [2019-09-16 17:05:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,224 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2019-09-16 17:05:34,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2019-09-16 17:05:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:05:34,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,226 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:34,226 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1888029101, now seen corresponding path program 1 times [2019-09-16 17:05:34,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:34,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,321 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand 4 states. [2019-09-16 17:05:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,715 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2019-09-16 17:05:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:05:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,718 INFO L225 Difference]: With dead ends: 332 [2019-09-16 17:05:34,718 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 17:05:34,719 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 17:05:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-16 17:05:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 409 transitions. [2019-09-16 17:05:34,725 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 409 transitions. Word has length 107 [2019-09-16 17:05:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,725 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 409 transitions. [2019-09-16 17:05:34,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 409 transitions. [2019-09-16 17:05:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:05:34,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,727 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:34,727 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2089853035, now seen corresponding path program 1 times [2019-09-16 17:05:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:34,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,805 INFO L87 Difference]: Start difference. First operand 272 states and 409 transitions. Second operand 4 states. [2019-09-16 17:05:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,135 INFO L93 Difference]: Finished difference Result 294 states and 437 transitions. [2019-09-16 17:05:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:05:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,138 INFO L225 Difference]: With dead ends: 294 [2019-09-16 17:05:35,138 INFO L226 Difference]: Without dead ends: 294 [2019-09-16 17:05:35,139 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-16 17:05:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-16 17:05:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 408 transitions. [2019-09-16 17:05:35,144 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 408 transitions. Word has length 107 [2019-09-16 17:05:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,145 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 408 transitions. [2019-09-16 17:05:35,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 408 transitions. [2019-09-16 17:05:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:05:35,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,146 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:35,147 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash -350223220, now seen corresponding path program 1 times [2019-09-16 17:05:35,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:35,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,231 INFO L87 Difference]: Start difference. First operand 272 states and 408 transitions. Second operand 4 states. [2019-09-16 17:05:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,593 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2019-09-16 17:05:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-16 17:05:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,596 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:05:35,596 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:05:35,596 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:05:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-16 17:05:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 407 transitions. [2019-09-16 17:05:35,602 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 407 transitions. Word has length 108 [2019-09-16 17:05:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,603 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 407 transitions. [2019-09-16 17:05:35,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 407 transitions. [2019-09-16 17:05:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:05:35,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,604 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:35,604 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1611351438, now seen corresponding path program 1 times [2019-09-16 17:05:35,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:35,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,677 INFO L87 Difference]: Start difference. First operand 272 states and 407 transitions. Second operand 4 states. [2019-09-16 17:05:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,945 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-16 17:05:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-16 17:05:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,948 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:05:35,948 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:05:35,949 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:05:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 272. [2019-09-16 17:05:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 406 transitions. [2019-09-16 17:05:35,954 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 406 transitions. Word has length 108 [2019-09-16 17:05:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,954 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 406 transitions. [2019-09-16 17:05:35,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 406 transitions. [2019-09-16 17:05:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:05:35,956 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,956 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:35,956 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1622638414, now seen corresponding path program 1 times [2019-09-16 17:05:35,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,038 INFO L87 Difference]: Start difference. First operand 272 states and 406 transitions. Second operand 4 states. [2019-09-16 17:05:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,423 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2019-09-16 17:05:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-16 17:05:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,425 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:05:36,425 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:05:36,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:05:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-16 17:05:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 17:05:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2019-09-16 17:05:36,432 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 112 [2019-09-16 17:05:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,433 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2019-09-16 17:05:36,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2019-09-16 17:05:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:05:36,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,434 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,434 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 986149044, now seen corresponding path program 1 times [2019-09-16 17:05:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 17:05:36,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:36,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:36,510 INFO L87 Difference]: Start difference. First operand 272 states and 405 transitions. Second operand 3 states. [2019-09-16 17:05:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,596 INFO L93 Difference]: Finished difference Result 517 states and 762 transitions. [2019-09-16 17:05:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:36,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-16 17:05:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,599 INFO L225 Difference]: With dead ends: 517 [2019-09-16 17:05:36,600 INFO L226 Difference]: Without dead ends: 517 [2019-09-16 17:05:36,600 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-16 17:05:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-09-16 17:05:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-09-16 17:05:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 762 transitions. [2019-09-16 17:05:36,611 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 762 transitions. Word has length 112 [2019-09-16 17:05:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,612 INFO L475 AbstractCegarLoop]: Abstraction has 517 states and 762 transitions. [2019-09-16 17:05:36,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 762 transitions. [2019-09-16 17:05:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-16 17:05:36,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,616 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,616 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 710276126, now seen corresponding path program 1 times [2019-09-16 17:05:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:36,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:36,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:36,681 INFO L87 Difference]: Start difference. First operand 517 states and 762 transitions. Second operand 3 states. [2019-09-16 17:05:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,771 INFO L93 Difference]: Finished difference Result 762 states and 1120 transitions. [2019-09-16 17:05:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:36,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-16 17:05:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,775 INFO L225 Difference]: With dead ends: 762 [2019-09-16 17:05:36,776 INFO L226 Difference]: Without dead ends: 762 [2019-09-16 17:05:36,776 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-16 17:05:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-09-16 17:05:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-09-16 17:05:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1120 transitions. [2019-09-16 17:05:36,788 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1120 transitions. Word has length 114 [2019-09-16 17:05:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,789 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1120 transitions. [2019-09-16 17:05:36,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1120 transitions. [2019-09-16 17:05:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:05:36,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,791 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,792 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,792 INFO L82 PathProgramCache]: Analyzing trace with hash 970034653, now seen corresponding path program 1 times [2019-09-16 17:05:36,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:36,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,891 INFO L87 Difference]: Start difference. First operand 762 states and 1120 transitions. Second operand 4 states. [2019-09-16 17:05:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,267 INFO L93 Difference]: Finished difference Result 951 states and 1411 transitions. [2019-09-16 17:05:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:05:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,274 INFO L225 Difference]: With dead ends: 951 [2019-09-16 17:05:37,274 INFO L226 Difference]: Without dead ends: 951 [2019-09-16 17:05:37,274 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-16 17:05:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-16 17:05:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1267 transitions. [2019-09-16 17:05:37,288 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1267 transitions. Word has length 143 [2019-09-16 17:05:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,289 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1267 transitions. [2019-09-16 17:05:37,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1267 transitions. [2019-09-16 17:05:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:05:37,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,292 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,292 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -468396027, now seen corresponding path program 1 times [2019-09-16 17:05:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:37,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,381 INFO L87 Difference]: Start difference. First operand 846 states and 1267 transitions. Second operand 4 states. [2019-09-16 17:05:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,732 INFO L93 Difference]: Finished difference Result 951 states and 1408 transitions. [2019-09-16 17:05:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:05:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,737 INFO L225 Difference]: With dead ends: 951 [2019-09-16 17:05:37,737 INFO L226 Difference]: Without dead ends: 951 [2019-09-16 17:05:37,738 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-16 17:05:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-16 17:05:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1264 transitions. [2019-09-16 17:05:37,751 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1264 transitions. Word has length 156 [2019-09-16 17:05:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,751 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1264 transitions. [2019-09-16 17:05:37,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1264 transitions. [2019-09-16 17:05:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:05:37,753 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,753 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,754 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2063887451, now seen corresponding path program 1 times [2019-09-16 17:05:37,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,862 INFO L87 Difference]: Start difference. First operand 846 states and 1264 transitions. Second operand 4 states. [2019-09-16 17:05:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,235 INFO L93 Difference]: Finished difference Result 948 states and 1402 transitions. [2019-09-16 17:05:38,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:05:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,239 INFO L225 Difference]: With dead ends: 948 [2019-09-16 17:05:38,239 INFO L226 Difference]: Without dead ends: 948 [2019-09-16 17:05:38,239 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-09-16 17:05:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 846. [2019-09-16 17:05:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1261 transitions. [2019-09-16 17:05:38,252 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1261 transitions. Word has length 157 [2019-09-16 17:05:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,252 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1261 transitions. [2019-09-16 17:05:38,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1261 transitions. [2019-09-16 17:05:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:05:38,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,254 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,255 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1730428324, now seen corresponding path program 1 times [2019-09-16 17:05:38,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:38,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,337 INFO L87 Difference]: Start difference. First operand 846 states and 1261 transitions. Second operand 4 states. [2019-09-16 17:05:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,696 INFO L93 Difference]: Finished difference Result 942 states and 1393 transitions. [2019-09-16 17:05:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:05:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,701 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:05:38,701 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:05:38,701 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:05:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-16 17:05:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1258 transitions. [2019-09-16 17:05:38,714 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1258 transitions. Word has length 157 [2019-09-16 17:05:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,714 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1258 transitions. [2019-09-16 17:05:38,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1258 transitions. [2019-09-16 17:05:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:05:38,716 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,717 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,717 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 873270338, now seen corresponding path program 1 times [2019-09-16 17:05:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:38,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,812 INFO L87 Difference]: Start difference. First operand 846 states and 1258 transitions. Second operand 4 states. [2019-09-16 17:05:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,221 INFO L93 Difference]: Finished difference Result 942 states and 1390 transitions. [2019-09-16 17:05:39,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:05:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,229 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:05:39,229 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:05:39,230 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:05:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-16 17:05:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1255 transitions. [2019-09-16 17:05:39,252 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1255 transitions. Word has length 158 [2019-09-16 17:05:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,253 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1255 transitions. [2019-09-16 17:05:39,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1255 transitions. [2019-09-16 17:05:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:05:39,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,256 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,257 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash 662427489, now seen corresponding path program 1 times [2019-09-16 17:05:39,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,353 INFO L87 Difference]: Start difference. First operand 846 states and 1255 transitions. Second operand 4 states. [2019-09-16 17:05:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,676 INFO L93 Difference]: Finished difference Result 942 states and 1387 transitions. [2019-09-16 17:05:39,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:05:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,681 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:05:39,681 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:05:39,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:05:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-16 17:05:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1252 transitions. [2019-09-16 17:05:39,696 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1252 transitions. Word has length 159 [2019-09-16 17:05:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,696 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1252 transitions. [2019-09-16 17:05:39,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1252 transitions. [2019-09-16 17:05:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:05:39,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,700 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,700 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1513533117, now seen corresponding path program 1 times [2019-09-16 17:05:39,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:39,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,826 INFO L87 Difference]: Start difference. First operand 846 states and 1252 transitions. Second operand 4 states. [2019-09-16 17:05:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,176 INFO L93 Difference]: Finished difference Result 942 states and 1384 transitions. [2019-09-16 17:05:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:05:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,184 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:05:40,184 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:05:40,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:05:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-16 17:05:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1249 transitions. [2019-09-16 17:05:40,197 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1249 transitions. Word has length 160 [2019-09-16 17:05:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,197 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1249 transitions. [2019-09-16 17:05:40,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1249 transitions. [2019-09-16 17:05:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:05:40,199 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,199 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,200 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash 925303164, now seen corresponding path program 1 times [2019-09-16 17:05:40,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,283 INFO L87 Difference]: Start difference. First operand 846 states and 1249 transitions. Second operand 4 states. [2019-09-16 17:05:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,623 INFO L93 Difference]: Finished difference Result 912 states and 1345 transitions. [2019-09-16 17:05:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:05:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,628 INFO L225 Difference]: With dead ends: 912 [2019-09-16 17:05:40,628 INFO L226 Difference]: Without dead ends: 912 [2019-09-16 17:05:40,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-16 17:05:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-16 17:05:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1246 transitions. [2019-09-16 17:05:40,640 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1246 transitions. Word has length 161 [2019-09-16 17:05:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,641 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1246 transitions. [2019-09-16 17:05:40,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1246 transitions. [2019-09-16 17:05:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:05:40,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,643 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,644 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1688700322, now seen corresponding path program 1 times [2019-09-16 17:05:40,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,735 INFO L87 Difference]: Start difference. First operand 846 states and 1246 transitions. Second operand 4 states. [2019-09-16 17:05:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,062 INFO L93 Difference]: Finished difference Result 912 states and 1342 transitions. [2019-09-16 17:05:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:05:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,067 INFO L225 Difference]: With dead ends: 912 [2019-09-16 17:05:41,067 INFO L226 Difference]: Without dead ends: 912 [2019-09-16 17:05:41,067 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-16 17:05:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-16 17:05:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1243 transitions. [2019-09-16 17:05:41,080 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1243 transitions. Word has length 165 [2019-09-16 17:05:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,080 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1243 transitions. [2019-09-16 17:05:41,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1243 transitions. [2019-09-16 17:05:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:05:41,082 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,083 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,083 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1820633757, now seen corresponding path program 1 times [2019-09-16 17:05:41,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:41,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,171 INFO L87 Difference]: Start difference. First operand 846 states and 1243 transitions. Second operand 4 states. [2019-09-16 17:05:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,465 INFO L93 Difference]: Finished difference Result 897 states and 1318 transitions. [2019-09-16 17:05:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:05:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,470 INFO L225 Difference]: With dead ends: 897 [2019-09-16 17:05:41,471 INFO L226 Difference]: Without dead ends: 897 [2019-09-16 17:05:41,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-16 17:05:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 846. [2019-09-16 17:05:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-16 17:05:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1240 transitions. [2019-09-16 17:05:41,483 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1240 transitions. Word has length 166 [2019-09-16 17:05:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,483 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1240 transitions. [2019-09-16 17:05:41,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1240 transitions. [2019-09-16 17:05:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-16 17:05:41,485 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,485 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,485 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1793770082, now seen corresponding path program 1 times [2019-09-16 17:05:41,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:05:41,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:41,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:41,620 INFO L87 Difference]: Start difference. First operand 846 states and 1240 transitions. Second operand 3 states. [2019-09-16 17:05:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,723 INFO L93 Difference]: Finished difference Result 1119 states and 1639 transitions. [2019-09-16 17:05:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:41,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-16 17:05:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,729 INFO L225 Difference]: With dead ends: 1119 [2019-09-16 17:05:41,729 INFO L226 Difference]: Without dead ends: 1119 [2019-09-16 17:05:41,730 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-16 17:05:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-09-16 17:05:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-16 17:05:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1639 transitions. [2019-09-16 17:05:41,740 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1639 transitions. Word has length 168 [2019-09-16 17:05:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,740 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1639 transitions. [2019-09-16 17:05:41,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1639 transitions. [2019-09-16 17:05:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:05:41,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,742 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,743 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1907591715, now seen corresponding path program 1 times [2019-09-16 17:05:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:05:41,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:41,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:41,824 INFO L87 Difference]: Start difference. First operand 1119 states and 1639 transitions. Second operand 3 states. [2019-09-16 17:05:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,916 INFO L93 Difference]: Finished difference Result 1392 states and 2039 transitions. [2019-09-16 17:05:41,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:41,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-16 17:05:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,922 INFO L225 Difference]: With dead ends: 1392 [2019-09-16 17:05:41,922 INFO L226 Difference]: Without dead ends: 1392 [2019-09-16 17:05:41,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-16 17:05:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2019-09-16 17:05:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-09-16 17:05:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2039 transitions. [2019-09-16 17:05:41,935 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2039 transitions. Word has length 174 [2019-09-16 17:05:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,936 INFO L475 AbstractCegarLoop]: Abstraction has 1392 states and 2039 transitions. [2019-09-16 17:05:41,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2039 transitions. [2019-09-16 17:05:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-16 17:05:41,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,938 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,938 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1799683995, now seen corresponding path program 1 times [2019-09-16 17:05:41,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:05:42,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:42,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:42,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,050 INFO L87 Difference]: Start difference. First operand 1392 states and 2039 transitions. Second operand 3 states. [2019-09-16 17:05:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,142 INFO L93 Difference]: Finished difference Result 1665 states and 2440 transitions. [2019-09-16 17:05:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:42,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-16 17:05:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,150 INFO L225 Difference]: With dead ends: 1665 [2019-09-16 17:05:42,151 INFO L226 Difference]: Without dead ends: 1665 [2019-09-16 17:05:42,151 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-09-16 17:05:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-09-16 17:05:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-09-16 17:05:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2440 transitions. [2019-09-16 17:05:42,169 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2440 transitions. Word has length 206 [2019-09-16 17:05:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,169 INFO L475 AbstractCegarLoop]: Abstraction has 1665 states and 2440 transitions. [2019-09-16 17:05:42,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2440 transitions. [2019-09-16 17:05:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-16 17:05:42,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,173 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,173 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash -176024399, now seen corresponding path program 1 times [2019-09-16 17:05:42,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:05:42,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:42,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,273 INFO L87 Difference]: Start difference. First operand 1665 states and 2440 transitions. Second operand 3 states. [2019-09-16 17:05:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,380 INFO L93 Difference]: Finished difference Result 1938 states and 2842 transitions. [2019-09-16 17:05:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:42,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-16 17:05:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,390 INFO L225 Difference]: With dead ends: 1938 [2019-09-16 17:05:42,390 INFO L226 Difference]: Without dead ends: 1938 [2019-09-16 17:05:42,391 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2019-09-16 17:05:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2019-09-16 17:05:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2019-09-16 17:05:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2842 transitions. [2019-09-16 17:05:42,410 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2842 transitions. Word has length 208 [2019-09-16 17:05:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,411 INFO L475 AbstractCegarLoop]: Abstraction has 1938 states and 2842 transitions. [2019-09-16 17:05:42,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2842 transitions. [2019-09-16 17:05:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-16 17:05:42,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,415 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,415 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash -613072162, now seen corresponding path program 1 times [2019-09-16 17:05:42,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-16 17:05:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:42,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,571 INFO L87 Difference]: Start difference. First operand 1938 states and 2842 transitions. Second operand 3 states. [2019-09-16 17:05:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,673 INFO L93 Difference]: Finished difference Result 2211 states and 3245 transitions. [2019-09-16 17:05:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:42,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-16 17:05:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,686 INFO L225 Difference]: With dead ends: 2211 [2019-09-16 17:05:42,686 INFO L226 Difference]: Without dead ends: 2211 [2019-09-16 17:05:42,688 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-16 17:05:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2019-09-16 17:05:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-09-16 17:05:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3245 transitions. [2019-09-16 17:05:42,711 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3245 transitions. Word has length 241 [2019-09-16 17:05:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,711 INFO L475 AbstractCegarLoop]: Abstraction has 2211 states and 3245 transitions. [2019-09-16 17:05:42,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3245 transitions. [2019-09-16 17:05:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-16 17:05:42,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,715 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,715 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 500095945, now seen corresponding path program 1 times [2019-09-16 17:05:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-16 17:05:42,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:42,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,860 INFO L87 Difference]: Start difference. First operand 2211 states and 3245 transitions. Second operand 3 states. [2019-09-16 17:05:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,947 INFO L93 Difference]: Finished difference Result 2476 states and 3630 transitions. [2019-09-16 17:05:42,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:42,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-09-16 17:05:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,954 INFO L225 Difference]: With dead ends: 2476 [2019-09-16 17:05:42,954 INFO L226 Difference]: Without dead ends: 2476 [2019-09-16 17:05:42,954 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2019-09-16 17:05:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2019-09-16 17:05:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-09-16 17:05:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3630 transitions. [2019-09-16 17:05:42,984 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3630 transitions. Word has length 276 [2019-09-16 17:05:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,985 INFO L475 AbstractCegarLoop]: Abstraction has 2476 states and 3630 transitions. [2019-09-16 17:05:42,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3630 transitions. [2019-09-16 17:05:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-16 17:05:42,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,990 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,990 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 315759838, now seen corresponding path program 1 times [2019-09-16 17:05:42,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-16 17:05:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:43,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:43,136 INFO L87 Difference]: Start difference. First operand 2476 states and 3630 transitions. Second operand 3 states. [2019-09-16 17:05:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,243 INFO L93 Difference]: Finished difference Result 2749 states and 4035 transitions. [2019-09-16 17:05:43,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:43,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-16 17:05:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,250 INFO L225 Difference]: With dead ends: 2749 [2019-09-16 17:05:43,251 INFO L226 Difference]: Without dead ends: 2749 [2019-09-16 17:05:43,251 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-09-16 17:05:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2019-09-16 17:05:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-09-16 17:05:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4035 transitions. [2019-09-16 17:05:43,283 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4035 transitions. Word has length 315 [2019-09-16 17:05:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,284 INFO L475 AbstractCegarLoop]: Abstraction has 2749 states and 4035 transitions. [2019-09-16 17:05:43,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4035 transitions. [2019-09-16 17:05:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-16 17:05:43,290 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,291 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:43,291 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1897551870, now seen corresponding path program 1 times [2019-09-16 17:05:43,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-16 17:05:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:43,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:43,519 INFO L87 Difference]: Start difference. First operand 2749 states and 4035 transitions. Second operand 3 states. [2019-09-16 17:05:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,621 INFO L93 Difference]: Finished difference Result 3022 states and 4441 transitions. [2019-09-16 17:05:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:43,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-16 17:05:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,629 INFO L225 Difference]: With dead ends: 3022 [2019-09-16 17:05:43,630 INFO L226 Difference]: Without dead ends: 3022 [2019-09-16 17:05:43,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-16 17:05:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2019-09-16 17:05:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2019-09-16 17:05:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4441 transitions. [2019-09-16 17:05:43,664 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4441 transitions. Word has length 356 [2019-09-16 17:05:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,664 INFO L475 AbstractCegarLoop]: Abstraction has 3022 states and 4441 transitions. [2019-09-16 17:05:43,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4441 transitions. [2019-09-16 17:05:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-16 17:05:43,670 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,671 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:43,671 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 184375628, now seen corresponding path program 1 times [2019-09-16 17:05:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-16 17:05:43,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:43,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:43,903 INFO L87 Difference]: Start difference. First operand 3022 states and 4441 transitions. Second operand 3 states. [2019-09-16 17:05:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,003 INFO L93 Difference]: Finished difference Result 3288 states and 4827 transitions. [2019-09-16 17:05:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:44,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-16 17:05:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,014 INFO L225 Difference]: With dead ends: 3288 [2019-09-16 17:05:44,014 INFO L226 Difference]: Without dead ends: 3288 [2019-09-16 17:05:44,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-09-16 17:05:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2019-09-16 17:05:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-09-16 17:05:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4827 transitions. [2019-09-16 17:05:44,079 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4827 transitions. Word has length 399 [2019-09-16 17:05:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,079 INFO L475 AbstractCegarLoop]: Abstraction has 3288 states and 4827 transitions. [2019-09-16 17:05:44,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4827 transitions. [2019-09-16 17:05:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-16 17:05:44,086 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,086 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:44,086 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash 287447201, now seen corresponding path program 1 times [2019-09-16 17:05:44,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-16 17:05:44,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:44,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:44,341 INFO L87 Difference]: Start difference. First operand 3288 states and 4827 transitions. Second operand 3 states. [2019-09-16 17:05:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,446 INFO L93 Difference]: Finished difference Result 3561 states and 5235 transitions. [2019-09-16 17:05:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:44,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 439 [2019-09-16 17:05:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,454 INFO L225 Difference]: With dead ends: 3561 [2019-09-16 17:05:44,454 INFO L226 Difference]: Without dead ends: 3561 [2019-09-16 17:05:44,455 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-09-16 17:05:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3561. [2019-09-16 17:05:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-09-16 17:05:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 5235 transitions. [2019-09-16 17:05:44,495 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 5235 transitions. Word has length 439 [2019-09-16 17:05:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,495 INFO L475 AbstractCegarLoop]: Abstraction has 3561 states and 5235 transitions. [2019-09-16 17:05:44,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 5235 transitions. [2019-09-16 17:05:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-16 17:05:44,503 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,503 INFO L407 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:44,504 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241564, now seen corresponding path program 1 times [2019-09-16 17:05:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-16 17:05:44,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:44,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:44,830 INFO L87 Difference]: Start difference. First operand 3561 states and 5235 transitions. Second operand 3 states. [2019-09-16 17:05:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,940 INFO L93 Difference]: Finished difference Result 3834 states and 5644 transitions. [2019-09-16 17:05:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:44,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-16 17:05:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,946 INFO L225 Difference]: With dead ends: 3834 [2019-09-16 17:05:44,946 INFO L226 Difference]: Without dead ends: 3834 [2019-09-16 17:05:44,946 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-09-16 17:05:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3834. [2019-09-16 17:05:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3834 states. [2019-09-16 17:05:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 5644 transitions. [2019-09-16 17:05:44,987 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 5644 transitions. Word has length 481 [2019-09-16 17:05:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,987 INFO L475 AbstractCegarLoop]: Abstraction has 3834 states and 5644 transitions. [2019-09-16 17:05:44,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5644 transitions. [2019-09-16 17:05:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-16 17:05:44,996 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,997 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:44,997 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -652036810, now seen corresponding path program 1 times [2019-09-16 17:05:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-16 17:05:45,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,398 INFO L87 Difference]: Start difference. First operand 3834 states and 5644 transitions. Second operand 4 states. [2019-09-16 17:05:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,869 INFO L93 Difference]: Finished difference Result 5379 states and 7957 transitions. [2019-09-16 17:05:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 525 [2019-09-16 17:05:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,875 INFO L225 Difference]: With dead ends: 5379 [2019-09-16 17:05:45,875 INFO L226 Difference]: Without dead ends: 5379 [2019-09-16 17:05:45,875 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-09-16 17:05:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4408. [2019-09-16 17:05:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4408 states. [2019-09-16 17:05:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 6694 transitions. [2019-09-16 17:05:45,915 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 6694 transitions. Word has length 525 [2019-09-16 17:05:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,916 INFO L475 AbstractCegarLoop]: Abstraction has 4408 states and 6694 transitions. [2019-09-16 17:05:45,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 6694 transitions. [2019-09-16 17:05:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-16 17:05:45,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,923 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:45,923 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1443846598, now seen corresponding path program 1 times [2019-09-16 17:05:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-09-16 17:05:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:46,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:46,336 INFO L87 Difference]: Start difference. First operand 4408 states and 6694 transitions. Second operand 3 states. [2019-09-16 17:05:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,516 INFO L93 Difference]: Finished difference Result 4716 states and 7156 transitions. [2019-09-16 17:05:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:46,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 525 [2019-09-16 17:05:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,523 INFO L225 Difference]: With dead ends: 4716 [2019-09-16 17:05:46,523 INFO L226 Difference]: Without dead ends: 4716 [2019-09-16 17:05:46,524 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-09-16 17:05:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-09-16 17:05:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-09-16 17:05:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 7156 transitions. [2019-09-16 17:05:46,583 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 7156 transitions. Word has length 525 [2019-09-16 17:05:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,584 INFO L475 AbstractCegarLoop]: Abstraction has 4716 states and 7156 transitions. [2019-09-16 17:05:46,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 7156 transitions. [2019-09-16 17:05:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-16 17:05:46,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,598 INFO L407 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:46,599 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1977910766, now seen corresponding path program 1 times [2019-09-16 17:05:46,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-09-16 17:05:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:46,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:46,910 INFO L87 Difference]: Start difference. First operand 4716 states and 7156 transitions. Second operand 3 states. [2019-09-16 17:05:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,021 INFO L93 Difference]: Finished difference Result 5030 states and 7642 transitions. [2019-09-16 17:05:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:47,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 566 [2019-09-16 17:05:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,028 INFO L225 Difference]: With dead ends: 5030 [2019-09-16 17:05:47,028 INFO L226 Difference]: Without dead ends: 5030 [2019-09-16 17:05:47,028 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2019-09-16 17:05:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 5030. [2019-09-16 17:05:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-09-16 17:05:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 7642 transitions. [2019-09-16 17:05:47,066 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 7642 transitions. Word has length 566 [2019-09-16 17:05:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,066 INFO L475 AbstractCegarLoop]: Abstraction has 5030 states and 7642 transitions. [2019-09-16 17:05:47,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 7642 transitions. [2019-09-16 17:05:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-16 17:05:47,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,074 INFO L407 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,075 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1687259843, now seen corresponding path program 1 times [2019-09-16 17:05:47,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-09-16 17:05:47,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:47,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:47,486 INFO L87 Difference]: Start difference. First operand 5030 states and 7642 transitions. Second operand 3 states. [2019-09-16 17:05:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,590 INFO L93 Difference]: Finished difference Result 5344 states and 8129 transitions. [2019-09-16 17:05:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:47,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-09-16 17:05:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,597 INFO L225 Difference]: With dead ends: 5344 [2019-09-16 17:05:47,597 INFO L226 Difference]: Without dead ends: 5344 [2019-09-16 17:05:47,598 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-09-16 17:05:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2019-09-16 17:05:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-09-16 17:05:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8129 transitions. [2019-09-16 17:05:47,637 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 8129 transitions. Word has length 609 [2019-09-16 17:05:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,637 INFO L475 AbstractCegarLoop]: Abstraction has 5344 states and 8129 transitions. [2019-09-16 17:05:47,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 8129 transitions. [2019-09-16 17:05:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-16 17:05:47,647 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,647 INFO L407 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,648 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1046145108, now seen corresponding path program 1 times [2019-09-16 17:05:47,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-16 17:05:48,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:48,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:48,171 INFO L87 Difference]: Start difference. First operand 5344 states and 8129 transitions. Second operand 3 states. [2019-09-16 17:05:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,273 INFO L93 Difference]: Finished difference Result 5653 states and 8592 transitions. [2019-09-16 17:05:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2019-09-16 17:05:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,281 INFO L225 Difference]: With dead ends: 5653 [2019-09-16 17:05:48,281 INFO L226 Difference]: Without dead ends: 5653 [2019-09-16 17:05:48,282 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-09-16 17:05:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5653. [2019-09-16 17:05:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-09-16 17:05:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8592 transitions. [2019-09-16 17:05:48,329 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8592 transitions. Word has length 654 [2019-09-16 17:05:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,330 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8592 transitions. [2019-09-16 17:05:48,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8592 transitions. [2019-09-16 17:05:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-16 17:05:48,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,337 INFO L407 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,337 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash -354222234, now seen corresponding path program 1 times [2019-09-16 17:05:48,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4490 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 3946 trivial. 0 not checked. [2019-09-16 17:05:48,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:48,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:48,773 INFO L87 Difference]: Start difference. First operand 5653 states and 8592 transitions. Second operand 3 states. [2019-09-16 17:05:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,877 INFO L93 Difference]: Finished difference Result 5967 states and 9081 transitions. [2019-09-16 17:05:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:48,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 696 [2019-09-16 17:05:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,885 INFO L225 Difference]: With dead ends: 5967 [2019-09-16 17:05:48,885 INFO L226 Difference]: Without dead ends: 5967 [2019-09-16 17:05:48,885 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2019-09-16 17:05:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5967. [2019-09-16 17:05:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5967 states. [2019-09-16 17:05:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5967 states to 5967 states and 9081 transitions. [2019-09-16 17:05:48,936 INFO L78 Accepts]: Start accepts. Automaton has 5967 states and 9081 transitions. Word has length 696 [2019-09-16 17:05:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,936 INFO L475 AbstractCegarLoop]: Abstraction has 5967 states and 9081 transitions. [2019-09-16 17:05:48,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5967 states and 9081 transitions. [2019-09-16 17:05:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-16 17:05:48,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,944 INFO L407 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,944 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 86706310, now seen corresponding path program 1 times [2019-09-16 17:05:48,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2019-09-16 17:05:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:49,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:49,387 INFO L87 Difference]: Start difference. First operand 5967 states and 9081 transitions. Second operand 3 states. [2019-09-16 17:05:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,517 INFO L93 Difference]: Finished difference Result 6281 states and 9571 transitions. [2019-09-16 17:05:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:49,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 740 [2019-09-16 17:05:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,525 INFO L225 Difference]: With dead ends: 6281 [2019-09-16 17:05:49,525 INFO L226 Difference]: Without dead ends: 6281 [2019-09-16 17:05:49,526 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2019-09-16 17:05:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6281. [2019-09-16 17:05:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2019-09-16 17:05:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 9571 transitions. [2019-09-16 17:05:49,587 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 9571 transitions. Word has length 740 [2019-09-16 17:05:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,588 INFO L475 AbstractCegarLoop]: Abstraction has 6281 states and 9571 transitions. [2019-09-16 17:05:49,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 9571 transitions. [2019-09-16 17:05:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-09-16 17:05:49,597 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,598 INFO L407 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,598 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2014212029, now seen corresponding path program 1 times [2019-09-16 17:05:49,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 754 proven. 324 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2019-09-16 17:05:50,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:50,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:50,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 787 with the following transitions: [2019-09-16 17:05:50,477 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [558], [561], [563], [566], [568], [571], [579], [584], [586], [588], [593], [596], [598], [601], [603], [606], [608], [611], [619], [624], [626], [629], [631], [634], [636], [639], [641], [644], [652], [657], [659], [680], [714], [716], [728], [731], [732], [744], [752], [753], [754] [2019-09-16 17:05:50,545 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:05:50,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:05:50,600 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:05:50,602 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:05:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,606 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:05:50,827 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:05:50,827 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:05:50,843 INFO L420 sIntCurrentIteration]: We unified 785 AI predicates to 785 [2019-09-16 17:05:50,843 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:05:50,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:50,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-16 17:05:50,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:05:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:05:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:50,851 INFO L87 Difference]: Start difference. First operand 6281 states and 9571 transitions. Second operand 2 states. [2019-09-16 17:05:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,852 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:05:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:05:50,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 786 [2019-09-16 17:05:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,853 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:05:50,853 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:50,853 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:50,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 786 [2019-09-16 17:05:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,854 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:50,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:05:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:50,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:50,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:50 BoogieIcfgContainer [2019-09-16 17:05:50,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:50,861 INFO L168 Benchmark]: Toolchain (without parser) took 33761.85 ms. Allocated memory was 133.2 MB in the beginning and 1.1 GB in the end (delta: 965.7 MB). Free memory was 86.0 MB in the beginning and 606.5 MB in the end (delta: -520.5 MB). Peak memory consumption was 445.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,861 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 948.87 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 85.8 MB in the beginning and 156.2 MB in the end (delta: -70.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,862 INFO L168 Benchmark]: Boogie Preprocessor took 126.25 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 147.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,863 INFO L168 Benchmark]: RCFGBuilder took 1438.16 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 147.8 MB in the beginning and 161.5 MB in the end (delta: -13.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,864 INFO L168 Benchmark]: TraceAbstraction took 31244.31 ms. Allocated memory was 225.4 MB in the beginning and 1.1 GB in the end (delta: 873.5 MB). Free memory was 161.5 MB in the beginning and 606.5 MB in the end (delta: -445.0 MB). Peak memory consumption was 428.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:50,866 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 948.87 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 85.8 MB in the beginning and 156.2 MB in the end (delta: -70.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.25 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 147.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1438.16 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 147.8 MB in the beginning and 161.5 MB in the end (delta: -13.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31244.31 ms. Allocated memory was 225.4 MB in the beginning and 1.1 GB in the end (delta: 873.5 MB). Free memory was 161.5 MB in the beginning and 606.5 MB in the end (delta: -445.0 MB). Peak memory consumption was 428.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 198 locations, 1 error locations. SAFE Result, 31.1s OverallTime, 67 OverallIterations, 21 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15989 SDtfs, 5887 SDslu, 19664 SDs, 0 SdLazy, 10171 SolverSat, 901 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1123 GetRequests, 931 SyntacticMatches, 37 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6281occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1031847133757962 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 67 MinimizatonAttempts, 2881 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 13325 NumberOfCodeBlocks, 13325 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 13258 ConstructedInterpolants, 0 QuantifiedInterpolants, 7099532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 66 PerfectInterpolantSequences, 43791/44115 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...