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-fea9116 [2019-09-20 13:27:19,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:19,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:19,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:19,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:19,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:19,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:19,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:19,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:19,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:19,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:19,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:19,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:19,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:19,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:19,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:19,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:19,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:19,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:19,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:19,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:19,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:19,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:19,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:19,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:19,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:19,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:19,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:19,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:19,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:19,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:19,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:19,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:19,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:19,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:19,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:19,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:19,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:19,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:19,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:19,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:19,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:19,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:19,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:19,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:19,438 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:19,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:19,439 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:19,439 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:19,439 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:19,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:19,440 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:19,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:19,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:19,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:19,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:19,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:19,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:19,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:19,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:19,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:19,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:19,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:19,444 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:19,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:19,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:19,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:19,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:19,445 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:19,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:19,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:19,446 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:19,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:19,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:19,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:19,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:19,508 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:19,508 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-20 13:27:19,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e2b65c2/844723731cea4621b8ed5626d990e3fc/FLAGd68abe371 [2019-09-20 13:27:20,165 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:20,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c [2019-09-20 13:27:20,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e2b65c2/844723731cea4621b8ed5626d990e3fc/FLAGd68abe371 [2019-09-20 13:27:20,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e2b65c2/844723731cea4621b8ed5626d990e3fc [2019-09-20 13:27:20,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:20,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:20,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:20,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:20,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:20,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:20" (1/1) ... [2019-09-20 13:27:20,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a30decc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:20, skipping insertion in model container [2019-09-20 13:27:20,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:20" (1/1) ... [2019-09-20 13:27:20,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:20,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:21,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:21,108 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:21,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:21,276 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:21,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21 WrapperNode [2019-09-20 13:27:21,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:21,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:21,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:21,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:21,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:21,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:21,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:21,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:21,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:21,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:21,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:22,299 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:23,124 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:23,125 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:23,159 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:23,159 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:23,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:23 BoogieIcfgContainer [2019-09-20 13:27:23,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:23,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:23,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:23,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:23,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:20" (1/3) ... [2019-09-20 13:27:23,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:23, skipping insertion in model container [2019-09-20 13:27:23,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (2/3) ... [2019-09-20 13:27:23,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:23, skipping insertion in model container [2019-09-20 13:27:23,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:23" (3/3) ... [2019-09-20 13:27:23,172 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-09-20 13:27:23,181 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:23,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:23,210 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:23,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:23,243 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:23,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:23,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:23,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:23,244 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:23,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:23,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-09-20 13:27:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:27:23,277 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,278 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,280 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -883272509, now seen corresponding path program 1 times [2019-09-20 13:27:23,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,738 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2019-09-20 13:27:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,194 INFO L93 Difference]: Finished difference Result 202 states and 334 transitions. [2019-09-20 13:27:24,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:27:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,211 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:27:24,211 INFO L226 Difference]: Without dead ends: 181 [2019-09-20 13:27:24,217 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-20 13:27:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-20 13:27:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:27:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 256 transitions. [2019-09-20 13:27:24,271 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 256 transitions. Word has length 51 [2019-09-20 13:27:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,272 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 256 transitions. [2019-09-20 13:27:24,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 256 transitions. [2019-09-20 13:27:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:24,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,276 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,277 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2034174241, now seen corresponding path program 1 times [2019-09-20 13:27:24,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,442 INFO L87 Difference]: Start difference. First operand 164 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,860 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2019-09-20 13:27:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,864 INFO L225 Difference]: With dead ends: 181 [2019-09-20 13:27:24,865 INFO L226 Difference]: Without dead ends: 181 [2019-09-20 13:27:24,868 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-20 13:27:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-20 13:27:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:27:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2019-09-20 13:27:24,893 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 64 [2019-09-20 13:27:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,893 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2019-09-20 13:27:24,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2019-09-20 13:27:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:24,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,901 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,902 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1818184895, now seen corresponding path program 1 times [2019-09-20 13:27:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,013 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand 4 states. [2019-09-20 13:27:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,316 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2019-09-20 13:27:25,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,318 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:25,318 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:25,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2019-09-20 13:27:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:27:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 254 transitions. [2019-09-20 13:27:25,327 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 254 transitions. Word has length 65 [2019-09-20 13:27:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,328 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 254 transitions. [2019-09-20 13:27:25,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 254 transitions. [2019-09-20 13:27:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:25,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,330 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,331 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1638771629, now seen corresponding path program 1 times [2019-09-20 13:27:25,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:25,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:25,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:25,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,445 INFO L87 Difference]: Start difference. First operand 164 states and 254 transitions. Second operand 5 states. [2019-09-20 13:27:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,984 INFO L93 Difference]: Finished difference Result 185 states and 282 transitions. [2019-09-20 13:27:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:25,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:27:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,986 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:25,986 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:27:25,990 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:27:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-20 13:27:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 281 transitions. [2019-09-20 13:27:26,010 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 281 transitions. Word has length 65 [2019-09-20 13:27:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,010 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 281 transitions. [2019-09-20 13:27:26,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 281 transitions. [2019-09-20 13:27:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:26,012 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,012 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,012 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash 936595467, now seen corresponding path program 1 times [2019-09-20 13:27:26,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,109 INFO L87 Difference]: Start difference. First operand 184 states and 281 transitions. Second operand 4 states. [2019-09-20 13:27:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,369 INFO L93 Difference]: Finished difference Result 199 states and 298 transitions. [2019-09-20 13:27:26,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,371 INFO L225 Difference]: With dead ends: 199 [2019-09-20 13:27:26,371 INFO L226 Difference]: Without dead ends: 199 [2019-09-20 13:27:26,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-20 13:27:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2019-09-20 13:27:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-09-20 13:27:26,378 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 65 [2019-09-20 13:27:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,378 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-09-20 13:27:26,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-09-20 13:27:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:26,380 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,380 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,381 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 435943946, now seen corresponding path program 1 times [2019-09-20 13:27:26,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,450 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 4 states. [2019-09-20 13:27:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,696 INFO L93 Difference]: Finished difference Result 197 states and 295 transitions. [2019-09-20 13:27:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,699 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:26,699 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:26,700 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-20 13:27:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 279 transitions. [2019-09-20 13:27:26,710 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 279 transitions. Word has length 65 [2019-09-20 13:27:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,710 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 279 transitions. [2019-09-20 13:27:26,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 279 transitions. [2019-09-20 13:27:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:26,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,711 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,712 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash -601039716, now seen corresponding path program 1 times [2019-09-20 13:27:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,840 INFO L87 Difference]: Start difference. First operand 184 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,080 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2019-09-20 13:27:27,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,082 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:27,082 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:27,083 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-20 13:27:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2019-09-20 13:27:27,088 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 66 [2019-09-20 13:27:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,089 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2019-09-20 13:27:27,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2019-09-20 13:27:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:27,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,090 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,090 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2091511225, now seen corresponding path program 1 times [2019-09-20 13:27:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,148 INFO L87 Difference]: Start difference. First operand 184 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,383 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2019-09-20 13:27:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,385 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:27,385 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:27,385 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-20 13:27:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2019-09-20 13:27:27,390 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 67 [2019-09-20 13:27:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,391 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2019-09-20 13:27:27,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2019-09-20 13:27:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:27,392 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,392 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,393 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2040778903, now seen corresponding path program 1 times [2019-09-20 13:27:27,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,447 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,716 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-20 13:27:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,718 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:27,718 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:27,718 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-20 13:27:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:27:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 276 transitions. [2019-09-20 13:27:27,724 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 276 transitions. Word has length 68 [2019-09-20 13:27:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,724 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 276 transitions. [2019-09-20 13:27:27,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 276 transitions. [2019-09-20 13:27:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:27,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,726 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,726 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1393046730, now seen corresponding path program 1 times [2019-09-20 13:27:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,789 INFO L87 Difference]: Start difference. First operand 184 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,083 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2019-09-20 13:27:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,088 INFO L225 Difference]: With dead ends: 226 [2019-09-20 13:27:28,088 INFO L226 Difference]: Without dead ends: 226 [2019-09-20 13:27:28,089 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-20 13:27:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-20 13:27:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2019-09-20 13:27:28,114 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 68 [2019-09-20 13:27:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,115 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2019-09-20 13:27:28,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2019-09-20 13:27:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:28,116 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,116 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,116 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 90053346, now seen corresponding path program 1 times [2019-09-20 13:27:28,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,197 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand 4 states. [2019-09-20 13:27:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,423 INFO L93 Difference]: Finished difference Result 209 states and 316 transitions. [2019-09-20 13:27:28,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,426 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:28,426 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:28,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-20 13:27:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 312 transitions. [2019-09-20 13:27:28,435 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 312 transitions. Word has length 69 [2019-09-20 13:27:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,435 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 312 transitions. [2019-09-20 13:27:28,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 312 transitions. [2019-09-20 13:27:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:28,437 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,437 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,437 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1646996660, now seen corresponding path program 1 times [2019-09-20 13:27:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,509 INFO L87 Difference]: Start difference. First operand 206 states and 312 transitions. Second operand 4 states. [2019-09-20 13:27:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,816 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2019-09-20 13:27:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,818 INFO L225 Difference]: With dead ends: 226 [2019-09-20 13:27:28,818 INFO L226 Difference]: Without dead ends: 226 [2019-09-20 13:27:28,818 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-20 13:27:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-20 13:27:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2019-09-20 13:27:28,824 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 81 [2019-09-20 13:27:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,825 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2019-09-20 13:27:28,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2019-09-20 13:27:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:28,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,826 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,827 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 54198590, now seen corresponding path program 1 times [2019-09-20 13:27:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,912 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand 4 states. [2019-09-20 13:27:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,178 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2019-09-20 13:27:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,180 INFO L225 Difference]: With dead ends: 225 [2019-09-20 13:27:29,180 INFO L226 Difference]: Without dead ends: 225 [2019-09-20 13:27:29,181 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-20 13:27:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2019-09-20 13:27:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2019-09-20 13:27:29,186 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 82 [2019-09-20 13:27:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,186 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2019-09-20 13:27:29,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2019-09-20 13:27:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:29,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,187 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,187 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash -446452931, now seen corresponding path program 1 times [2019-09-20 13:27:29,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,245 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand 4 states. [2019-09-20 13:27:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,533 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2019-09-20 13:27:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,535 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:29,535 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:29,536 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-20 13:27:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 309 transitions. [2019-09-20 13:27:29,541 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 309 transitions. Word has length 82 [2019-09-20 13:27:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,541 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 309 transitions. [2019-09-20 13:27:29,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 309 transitions. [2019-09-20 13:27:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:29,543 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,543 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,543 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2109428169, now seen corresponding path program 1 times [2019-09-20 13:27:29,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,606 INFO L87 Difference]: Start difference. First operand 206 states and 309 transitions. Second operand 4 states. [2019-09-20 13:27:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,861 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2019-09-20 13:27:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,863 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:29,863 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:29,863 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-20 13:27:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2019-09-20 13:27:29,869 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 83 [2019-09-20 13:27:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,870 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2019-09-20 13:27:29,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2019-09-20 13:27:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:29,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,871 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,871 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 328614586, now seen corresponding path program 1 times [2019-09-20 13:27:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,932 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand 4 states. [2019-09-20 13:27:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,180 INFO L93 Difference]: Finished difference Result 223 states and 329 transitions. [2019-09-20 13:27:30,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,182 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:30,183 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:30,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-20 13:27:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 307 transitions. [2019-09-20 13:27:30,189 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 307 transitions. Word has length 84 [2019-09-20 13:27:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,189 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 307 transitions. [2019-09-20 13:27:30,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 307 transitions. [2019-09-20 13:27:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:30,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,191 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -244732284, now seen corresponding path program 1 times [2019-09-20 13:27:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,244 INFO L87 Difference]: Start difference. First operand 206 states and 307 transitions. Second operand 4 states. [2019-09-20 13:27:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,502 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2019-09-20 13:27:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,504 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:30,505 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:30,505 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-20 13:27:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 306 transitions. [2019-09-20 13:27:30,512 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 306 transitions. Word has length 85 [2019-09-20 13:27:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,512 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 306 transitions. [2019-09-20 13:27:30,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 306 transitions. [2019-09-20 13:27:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:30,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,514 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,514 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2041316715, now seen corresponding path program 1 times [2019-09-20 13:27:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,596 INFO L87 Difference]: Start difference. First operand 206 states and 306 transitions. Second operand 4 states. [2019-09-20 13:27:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,859 INFO L93 Difference]: Finished difference Result 213 states and 315 transitions. [2019-09-20 13:27:30,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,860 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:30,861 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:30,861 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2019-09-20 13:27:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:27:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 305 transitions. [2019-09-20 13:27:30,867 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 305 transitions. Word has length 86 [2019-09-20 13:27:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,867 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 305 transitions. [2019-09-20 13:27:30,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 305 transitions. [2019-09-20 13:27:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:30,868 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,869 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,869 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1423979757, now seen corresponding path program 1 times [2019-09-20 13:27:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,940 INFO L87 Difference]: Start difference. First operand 206 states and 305 transitions. Second operand 4 states. [2019-09-20 13:27:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,337 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-09-20 13:27:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,340 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:27:31,340 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:27:31,341 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:27:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-09-20 13:27:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-20 13:27:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 378 transitions. [2019-09-20 13:27:31,349 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 378 transitions. Word has length 90 [2019-09-20 13:27:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,349 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 378 transitions. [2019-09-20 13:27:31,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 378 transitions. [2019-09-20 13:27:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:31,351 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,351 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,351 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 526586479, now seen corresponding path program 1 times [2019-09-20 13:27:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,415 INFO L87 Difference]: Start difference. First operand 247 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,703 INFO L93 Difference]: Finished difference Result 296 states and 451 transitions. [2019-09-20 13:27:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,706 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:27:31,706 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:27:31,707 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:27:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-20 13:27:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2019-09-20 13:27:31,713 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 90 [2019-09-20 13:27:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,713 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2019-09-20 13:27:31,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2019-09-20 13:27:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:27:31,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,715 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-20 13:27:31,715 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1255891959, now seen corresponding path program 1 times [2019-09-20 13:27:31,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,789 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand 4 states. [2019-09-20 13:27:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,327 INFO L93 Difference]: Finished difference Result 335 states and 509 transitions. [2019-09-20 13:27:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-20 13:27:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,331 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:27:32,331 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:27:32,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:27:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-20 13:27:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2019-09-20 13:27:32,339 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 91 [2019-09-20 13:27:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,340 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2019-09-20 13:27:32,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2019-09-20 13:27:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:32,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,342 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2083138293, now seen corresponding path program 1 times [2019-09-20 13:27:32,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,466 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand 4 states. [2019-09-20 13:27:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,996 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2019-09-20 13:27:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,000 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:27:33,001 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:27:33,001 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:27:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-20 13:27:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2019-09-20 13:27:33,008 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 419 transitions. Word has length 103 [2019-09-20 13:27:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,008 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 419 transitions. [2019-09-20 13:27:33,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 419 transitions. [2019-09-20 13:27:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:33,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,010 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,010 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2123813043, now seen corresponding path program 1 times [2019-09-20 13:27:33,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,103 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. Second operand 4 states. [2019-09-20 13:27:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,391 INFO L93 Difference]: Finished difference Result 297 states and 450 transitions. [2019-09-20 13:27:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,394 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:27:33,394 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:27:33,395 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:27:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 272. [2019-09-20 13:27:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 418 transitions. [2019-09-20 13:27:33,401 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 418 transitions. Word has length 103 [2019-09-20 13:27:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,401 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 418 transitions. [2019-09-20 13:27:33,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 418 transitions. [2019-09-20 13:27:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,403 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,403 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -275734859, now seen corresponding path program 1 times [2019-09-20 13:27:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,474 INFO L87 Difference]: Start difference. First operand 272 states and 418 transitions. Second operand 4 states. [2019-09-20 13:27:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,919 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-09-20 13:27:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,921 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:27:33,922 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:27:33,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:27:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 272. [2019-09-20 13:27:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 417 transitions. [2019-09-20 13:27:33,929 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 417 transitions. Word has length 104 [2019-09-20 13:27:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,929 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 417 transitions. [2019-09-20 13:27:33,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 417 transitions. [2019-09-20 13:27:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,931 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,931 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash -776386380, now seen corresponding path program 1 times [2019-09-20 13:27:33,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,027 INFO L87 Difference]: Start difference. First operand 272 states and 417 transitions. Second operand 4 states. [2019-09-20 13:27:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,414 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2019-09-20 13:27:34,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,417 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:34,417 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:34,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-20 13:27:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-20 13:27:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 416 transitions. [2019-09-20 13:27:34,424 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 416 transitions. Word has length 104 [2019-09-20 13:27:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,425 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 416 transitions. [2019-09-20 13:27:34,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 416 transitions. [2019-09-20 13:27:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:34,426 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,426 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,427 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash 985182391, now seen corresponding path program 1 times [2019-09-20 13:27:34,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,495 INFO L87 Difference]: Start difference. First operand 272 states and 416 transitions. Second operand 4 states. [2019-09-20 13:27:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,768 INFO L93 Difference]: Finished difference Result 296 states and 446 transitions. [2019-09-20 13:27:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,770 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:27:34,771 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:27:34,771 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:27:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2019-09-20 13:27:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 415 transitions. [2019-09-20 13:27:34,777 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 415 transitions. Word has length 104 [2019-09-20 13:27:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,777 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 415 transitions. [2019-09-20 13:27:34,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2019-09-20 13:27:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:34,779 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,779 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,779 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 484530870, now seen corresponding path program 1 times [2019-09-20 13:27:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,874 INFO L87 Difference]: Start difference. First operand 272 states and 415 transitions. Second operand 4 states. [2019-09-20 13:27:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,212 INFO L93 Difference]: Finished difference Result 294 states and 443 transitions. [2019-09-20 13:27:35,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,215 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:35,215 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:35,216 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-20 13:27:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 414 transitions. [2019-09-20 13:27:35,222 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 414 transitions. Word has length 104 [2019-09-20 13:27:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,222 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 414 transitions. [2019-09-20 13:27:35,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 414 transitions. [2019-09-20 13:27:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:35,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,224 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,224 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash 471425842, now seen corresponding path program 1 times [2019-09-20 13:27:35,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,282 INFO L87 Difference]: Start difference. First operand 272 states and 414 transitions. Second operand 4 states. [2019-09-20 13:27:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,710 INFO L93 Difference]: Finished difference Result 332 states and 499 transitions. [2019-09-20 13:27:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,713 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:35,713 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:35,714 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-20 13:27:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2019-09-20 13:27:35,723 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 105 [2019-09-20 13:27:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,724 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2019-09-20 13:27:35,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2019-09-20 13:27:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:35,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,726 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,727 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 905154928, now seen corresponding path program 1 times [2019-09-20 13:27:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,827 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand 4 states. [2019-09-20 13:27:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,182 INFO L93 Difference]: Finished difference Result 294 states and 441 transitions. [2019-09-20 13:27:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,185 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:36,185 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:36,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-20 13:27:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2019-09-20 13:27:36,191 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 105 [2019-09-20 13:27:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,191 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2019-09-20 13:27:36,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2019-09-20 13:27:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:36,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,193 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,193 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1090150001, now seen corresponding path program 1 times [2019-09-20 13:27:36,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,252 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 4 states. [2019-09-20 13:27:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,633 INFO L93 Difference]: Finished difference Result 332 states and 497 transitions. [2019-09-20 13:27:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,634 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:36,635 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:36,635 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-20 13:27:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 411 transitions. [2019-09-20 13:27:36,641 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 411 transitions. Word has length 106 [2019-09-20 13:27:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,641 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 411 transitions. [2019-09-20 13:27:36,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2019-09-20 13:27:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:36,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,643 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,643 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1650849779, now seen corresponding path program 1 times [2019-09-20 13:27:36,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,702 INFO L87 Difference]: Start difference. First operand 272 states and 411 transitions. Second operand 4 states. [2019-09-20 13:27:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,013 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2019-09-20 13:27:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,016 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:37,016 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:37,016 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-20 13:27:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2019-09-20 13:27:37,024 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 106 [2019-09-20 13:27:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,025 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2019-09-20 13:27:37,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2019-09-20 13:27:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:37,027 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,027 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,028 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1888029101, now seen corresponding path program 1 times [2019-09-20 13:27:37,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,148 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand 4 states. [2019-09-20 13:27:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,536 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2019-09-20 13:27:37,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,539 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:37,539 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:37,539 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-20 13:27:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 409 transitions. [2019-09-20 13:27:37,547 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 409 transitions. Word has length 107 [2019-09-20 13:27:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,548 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 409 transitions. [2019-09-20 13:27:37,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 409 transitions. [2019-09-20 13:27:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:37,550 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,550 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,550 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2089853035, now seen corresponding path program 1 times [2019-09-20 13:27:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,657 INFO L87 Difference]: Start difference. First operand 272 states and 409 transitions. Second operand 4 states. [2019-09-20 13:27:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,925 INFO L93 Difference]: Finished difference Result 294 states and 437 transitions. [2019-09-20 13:27:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,928 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:37,928 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:37,929 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-20 13:27:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 408 transitions. [2019-09-20 13:27:37,937 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 408 transitions. Word has length 107 [2019-09-20 13:27:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,937 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 408 transitions. [2019-09-20 13:27:37,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 408 transitions. [2019-09-20 13:27:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:37,939 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,939 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,939 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -350223220, now seen corresponding path program 1 times [2019-09-20 13:27:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,007 INFO L87 Difference]: Start difference. First operand 272 states and 408 transitions. Second operand 4 states. [2019-09-20 13:27:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,350 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2019-09-20 13:27:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,353 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:27:38,353 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:27:38,354 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:27:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-20 13:27:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 407 transitions. [2019-09-20 13:27:38,359 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 407 transitions. Word has length 108 [2019-09-20 13:27:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,359 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 407 transitions. [2019-09-20 13:27:38,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 407 transitions. [2019-09-20 13:27:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:38,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,361 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,361 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1611351438, now seen corresponding path program 1 times [2019-09-20 13:27:38,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,432 INFO L87 Difference]: Start difference. First operand 272 states and 407 transitions. Second operand 4 states. [2019-09-20 13:27:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,695 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-20 13:27:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,697 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:38,697 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:38,697 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 272. [2019-09-20 13:27:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 406 transitions. [2019-09-20 13:27:38,702 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 406 transitions. Word has length 108 [2019-09-20 13:27:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,703 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 406 transitions. [2019-09-20 13:27:38,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 406 transitions. [2019-09-20 13:27:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:38,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,704 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,704 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1622638414, now seen corresponding path program 1 times [2019-09-20 13:27:38,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,782 INFO L87 Difference]: Start difference. First operand 272 states and 406 transitions. Second operand 4 states. [2019-09-20 13:27:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,130 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2019-09-20 13:27:39,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:27:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,133 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:27:39,133 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:27:39,133 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:27:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-20 13:27:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-20 13:27:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2019-09-20 13:27:39,139 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 112 [2019-09-20 13:27:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,139 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2019-09-20 13:27:39,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2019-09-20 13:27:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:39,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,141 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,141 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 986149044, now seen corresponding path program 1 times [2019-09-20 13:27:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:39,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:39,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:39,205 INFO L87 Difference]: Start difference. First operand 272 states and 405 transitions. Second operand 3 states. [2019-09-20 13:27:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,305 INFO L93 Difference]: Finished difference Result 517 states and 762 transitions. [2019-09-20 13:27:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:39,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:27:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,308 INFO L225 Difference]: With dead ends: 517 [2019-09-20 13:27:39,308 INFO L226 Difference]: Without dead ends: 517 [2019-09-20 13:27:39,309 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-20 13:27:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-09-20 13:27:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-09-20 13:27:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 762 transitions. [2019-09-20 13:27:39,347 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 762 transitions. Word has length 112 [2019-09-20 13:27:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,349 INFO L475 AbstractCegarLoop]: Abstraction has 517 states and 762 transitions. [2019-09-20 13:27:39,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 762 transitions. [2019-09-20 13:27:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:27:39,351 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,351 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-20 13:27:39,351 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 710276126, now seen corresponding path program 1 times [2019-09-20 13:27:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,418 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-20 13:27:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:39,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:39,419 INFO L87 Difference]: Start difference. First operand 517 states and 762 transitions. Second operand 3 states. [2019-09-20 13:27:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,514 INFO L93 Difference]: Finished difference Result 762 states and 1120 transitions. [2019-09-20 13:27:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:39,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-20 13:27:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,518 INFO L225 Difference]: With dead ends: 762 [2019-09-20 13:27:39,518 INFO L226 Difference]: Without dead ends: 762 [2019-09-20 13:27:39,518 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-20 13:27:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-09-20 13:27:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-09-20 13:27:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1120 transitions. [2019-09-20 13:27:39,531 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1120 transitions. Word has length 114 [2019-09-20 13:27:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,531 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1120 transitions. [2019-09-20 13:27:39,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1120 transitions. [2019-09-20 13:27:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:27:39,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,534 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-20 13:27:39,534 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 970034653, now seen corresponding path program 1 times [2019-09-20 13:27:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,608 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-20 13:27:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,610 INFO L87 Difference]: Start difference. First operand 762 states and 1120 transitions. Second operand 4 states. [2019-09-20 13:27:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,946 INFO L93 Difference]: Finished difference Result 951 states and 1411 transitions. [2019-09-20 13:27:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:27:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,951 INFO L225 Difference]: With dead ends: 951 [2019-09-20 13:27:39,951 INFO L226 Difference]: Without dead ends: 951 [2019-09-20 13:27:39,952 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-20 13:27:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-20 13:27:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1267 transitions. [2019-09-20 13:27:39,967 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1267 transitions. Word has length 143 [2019-09-20 13:27:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,967 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1267 transitions. [2019-09-20 13:27:39,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1267 transitions. [2019-09-20 13:27:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:39,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,970 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-20 13:27:39,970 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -468396027, now seen corresponding path program 1 times [2019-09-20 13:27:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,040 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-20 13:27:40,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,042 INFO L87 Difference]: Start difference. First operand 846 states and 1267 transitions. Second operand 4 states. [2019-09-20 13:27:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,374 INFO L93 Difference]: Finished difference Result 951 states and 1408 transitions. [2019-09-20 13:27:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:27:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,379 INFO L225 Difference]: With dead ends: 951 [2019-09-20 13:27:40,379 INFO L226 Difference]: Without dead ends: 951 [2019-09-20 13:27:40,380 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-20 13:27:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-20 13:27:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1264 transitions. [2019-09-20 13:27:40,394 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1264 transitions. Word has length 156 [2019-09-20 13:27:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,395 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1264 transitions. [2019-09-20 13:27:40,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1264 transitions. [2019-09-20 13:27:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:40,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,397 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-20 13:27:40,397 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2063887451, now seen corresponding path program 1 times [2019-09-20 13:27:40,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,472 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-20 13:27:40,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,474 INFO L87 Difference]: Start difference. First operand 846 states and 1264 transitions. Second operand 4 states. [2019-09-20 13:27:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,814 INFO L93 Difference]: Finished difference Result 948 states and 1402 transitions. [2019-09-20 13:27:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,818 INFO L225 Difference]: With dead ends: 948 [2019-09-20 13:27:40,818 INFO L226 Difference]: Without dead ends: 948 [2019-09-20 13:27:40,819 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-09-20 13:27:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 846. [2019-09-20 13:27:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1261 transitions. [2019-09-20 13:27:40,838 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1261 transitions. Word has length 157 [2019-09-20 13:27:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,839 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1261 transitions. [2019-09-20 13:27:40,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1261 transitions. [2019-09-20 13:27:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:40,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,842 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-20 13:27:40,842 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1730428324, now seen corresponding path program 1 times [2019-09-20 13:27:40,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,968 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-20 13:27:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,970 INFO L87 Difference]: Start difference. First operand 846 states and 1261 transitions. Second operand 4 states. [2019-09-20 13:27:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,301 INFO L93 Difference]: Finished difference Result 942 states and 1393 transitions. [2019-09-20 13:27:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,306 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:27:41,306 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:27:41,306 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:27:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-20 13:27:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1258 transitions. [2019-09-20 13:27:41,320 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1258 transitions. Word has length 157 [2019-09-20 13:27:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,320 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1258 transitions. [2019-09-20 13:27:41,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1258 transitions. [2019-09-20 13:27:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:27:41,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,323 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-20 13:27:41,323 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 873270338, now seen corresponding path program 1 times [2019-09-20 13:27:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,407 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-20 13:27:41,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,409 INFO L87 Difference]: Start difference. First operand 846 states and 1258 transitions. Second operand 4 states. [2019-09-20 13:27:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,724 INFO L93 Difference]: Finished difference Result 942 states and 1390 transitions. [2019-09-20 13:27:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:27:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,728 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:27:41,728 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:27:41,729 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:27:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-20 13:27:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1255 transitions. [2019-09-20 13:27:41,742 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1255 transitions. Word has length 158 [2019-09-20 13:27:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,742 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1255 transitions. [2019-09-20 13:27:41,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1255 transitions. [2019-09-20 13:27:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:27:41,745 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,745 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-20 13:27:41,745 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 662427489, now seen corresponding path program 1 times [2019-09-20 13:27:41,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,817 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-20 13:27:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,818 INFO L87 Difference]: Start difference. First operand 846 states and 1255 transitions. Second operand 4 states. [2019-09-20 13:27:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,129 INFO L93 Difference]: Finished difference Result 942 states and 1387 transitions. [2019-09-20 13:27:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:27:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,135 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:27:42,135 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:27:42,135 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:27:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-20 13:27:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1252 transitions. [2019-09-20 13:27:42,149 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1252 transitions. Word has length 159 [2019-09-20 13:27:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,149 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1252 transitions. [2019-09-20 13:27:42,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1252 transitions. [2019-09-20 13:27:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:27:42,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,152 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-20 13:27:42,152 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1513533117, now seen corresponding path program 1 times [2019-09-20 13:27:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,233 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-20 13:27:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,234 INFO L87 Difference]: Start difference. First operand 846 states and 1252 transitions. Second operand 4 states. [2019-09-20 13:27:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,574 INFO L93 Difference]: Finished difference Result 942 states and 1384 transitions. [2019-09-20 13:27:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:27:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,581 INFO L225 Difference]: With dead ends: 942 [2019-09-20 13:27:42,581 INFO L226 Difference]: Without dead ends: 942 [2019-09-20 13:27:42,582 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-20 13:27:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-20 13:27:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1249 transitions. [2019-09-20 13:27:42,594 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1249 transitions. Word has length 160 [2019-09-20 13:27:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,594 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1249 transitions. [2019-09-20 13:27:42,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1249 transitions. [2019-09-20 13:27:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:27:42,597 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,598 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-20 13:27:42,598 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 925303164, now seen corresponding path program 1 times [2019-09-20 13:27:42,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,677 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-20 13:27:42,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,679 INFO L87 Difference]: Start difference. First operand 846 states and 1249 transitions. Second operand 4 states. [2019-09-20 13:27:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,971 INFO L93 Difference]: Finished difference Result 912 states and 1345 transitions. [2019-09-20 13:27:42,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-20 13:27:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,976 INFO L225 Difference]: With dead ends: 912 [2019-09-20 13:27:42,976 INFO L226 Difference]: Without dead ends: 912 [2019-09-20 13:27:42,977 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-20 13:27:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-20 13:27:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1246 transitions. [2019-09-20 13:27:42,989 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1246 transitions. Word has length 161 [2019-09-20 13:27:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,989 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1246 transitions. [2019-09-20 13:27:42,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1246 transitions. [2019-09-20 13:27:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-20 13:27:42,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,992 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-20 13:27:42,992 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1688700322, now seen corresponding path program 1 times [2019-09-20 13:27:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,072 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-20 13:27:43,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,074 INFO L87 Difference]: Start difference. First operand 846 states and 1246 transitions. Second operand 4 states. [2019-09-20 13:27:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,385 INFO L93 Difference]: Finished difference Result 912 states and 1342 transitions. [2019-09-20 13:27:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-20 13:27:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,389 INFO L225 Difference]: With dead ends: 912 [2019-09-20 13:27:43,389 INFO L226 Difference]: Without dead ends: 912 [2019-09-20 13:27:43,390 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-20 13:27:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-20 13:27:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1243 transitions. [2019-09-20 13:27:43,400 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1243 transitions. Word has length 165 [2019-09-20 13:27:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,401 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1243 transitions. [2019-09-20 13:27:43,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1243 transitions. [2019-09-20 13:27:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-20 13:27:43,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,408 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-20 13:27:43,408 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1820633757, now seen corresponding path program 1 times [2019-09-20 13:27:43,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,487 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-20 13:27:43,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,490 INFO L87 Difference]: Start difference. First operand 846 states and 1243 transitions. Second operand 4 states. [2019-09-20 13:27:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,796 INFO L93 Difference]: Finished difference Result 897 states and 1318 transitions. [2019-09-20 13:27:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-20 13:27:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,801 INFO L225 Difference]: With dead ends: 897 [2019-09-20 13:27:43,801 INFO L226 Difference]: Without dead ends: 897 [2019-09-20 13:27:43,801 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-20 13:27:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 846. [2019-09-20 13:27:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-20 13:27:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1240 transitions. [2019-09-20 13:27:43,812 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1240 transitions. Word has length 166 [2019-09-20 13:27:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,812 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1240 transitions. [2019-09-20 13:27:43,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1240 transitions. [2019-09-20 13:27:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-20 13:27:43,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,816 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-20 13:27:43,816 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1793770082, now seen corresponding path program 1 times [2019-09-20 13:27:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,903 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-20 13:27:43,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:43,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:43,905 INFO L87 Difference]: Start difference. First operand 846 states and 1240 transitions. Second operand 3 states. [2019-09-20 13:27:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,037 INFO L93 Difference]: Finished difference Result 1119 states and 1639 transitions. [2019-09-20 13:27:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:44,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-20 13:27:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,042 INFO L225 Difference]: With dead ends: 1119 [2019-09-20 13:27:44,042 INFO L226 Difference]: Without dead ends: 1119 [2019-09-20 13:27:44,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-20 13:27:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-09-20 13:27:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-20 13:27:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1639 transitions. [2019-09-20 13:27:44,054 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1639 transitions. Word has length 168 [2019-09-20 13:27:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,055 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1639 transitions. [2019-09-20 13:27:44,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1639 transitions. [2019-09-20 13:27:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-20 13:27:44,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,058 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-20 13:27:44,058 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1907591715, now seen corresponding path program 1 times [2019-09-20 13:27:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,137 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-20 13:27:44,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:44,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,143 INFO L87 Difference]: Start difference. First operand 1119 states and 1639 transitions. Second operand 3 states. [2019-09-20 13:27:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,249 INFO L93 Difference]: Finished difference Result 1392 states and 2039 transitions. [2019-09-20 13:27:44,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:44,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-20 13:27:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,256 INFO L225 Difference]: With dead ends: 1392 [2019-09-20 13:27:44,256 INFO L226 Difference]: Without dead ends: 1392 [2019-09-20 13:27:44,257 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-20 13:27:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2019-09-20 13:27:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-09-20 13:27:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2039 transitions. [2019-09-20 13:27:44,283 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2039 transitions. Word has length 174 [2019-09-20 13:27:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,284 INFO L475 AbstractCegarLoop]: Abstraction has 1392 states and 2039 transitions. [2019-09-20 13:27:44,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2039 transitions. [2019-09-20 13:27:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-20 13:27:44,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,288 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-20 13:27:44,289 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1799683995, now seen corresponding path program 1 times [2019-09-20 13:27:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,426 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-20 13:27:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:44,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,429 INFO L87 Difference]: Start difference. First operand 1392 states and 2039 transitions. Second operand 3 states. [2019-09-20 13:27:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,537 INFO L93 Difference]: Finished difference Result 1665 states and 2440 transitions. [2019-09-20 13:27:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:44,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-20 13:27:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,544 INFO L225 Difference]: With dead ends: 1665 [2019-09-20 13:27:44,545 INFO L226 Difference]: Without dead ends: 1665 [2019-09-20 13:27:44,545 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-09-20 13:27:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-09-20 13:27:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-09-20 13:27:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2440 transitions. [2019-09-20 13:27:44,565 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2440 transitions. Word has length 206 [2019-09-20 13:27:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,566 INFO L475 AbstractCegarLoop]: Abstraction has 1665 states and 2440 transitions. [2019-09-20 13:27:44,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2440 transitions. [2019-09-20 13:27:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-20 13:27:44,570 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,571 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-20 13:27:44,571 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash -176024399, now seen corresponding path program 1 times [2019-09-20 13:27:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,664 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-20 13:27:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:44,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,666 INFO L87 Difference]: Start difference. First operand 1665 states and 2440 transitions. Second operand 3 states. [2019-09-20 13:27:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,762 INFO L93 Difference]: Finished difference Result 1938 states and 2842 transitions. [2019-09-20 13:27:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:44,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-20 13:27:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,781 INFO L225 Difference]: With dead ends: 1938 [2019-09-20 13:27:44,782 INFO L226 Difference]: Without dead ends: 1938 [2019-09-20 13:27:44,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2019-09-20 13:27:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2019-09-20 13:27:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2019-09-20 13:27:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2842 transitions. [2019-09-20 13:27:44,810 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2842 transitions. Word has length 208 [2019-09-20 13:27:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,811 INFO L475 AbstractCegarLoop]: Abstraction has 1938 states and 2842 transitions. [2019-09-20 13:27:44,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2842 transitions. [2019-09-20 13:27:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-20 13:27:44,815 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,815 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-20 13:27:44,815 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -613072162, now seen corresponding path program 1 times [2019-09-20 13:27:44,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,953 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-20 13:27:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:44,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,954 INFO L87 Difference]: Start difference. First operand 1938 states and 2842 transitions. Second operand 3 states. [2019-09-20 13:27:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,050 INFO L93 Difference]: Finished difference Result 2211 states and 3245 transitions. [2019-09-20 13:27:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:45,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-20 13:27:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,057 INFO L225 Difference]: With dead ends: 2211 [2019-09-20 13:27:45,058 INFO L226 Difference]: Without dead ends: 2211 [2019-09-20 13:27:45,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-20 13:27:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2019-09-20 13:27:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-09-20 13:27:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3245 transitions. [2019-09-20 13:27:45,084 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3245 transitions. Word has length 241 [2019-09-20 13:27:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,085 INFO L475 AbstractCegarLoop]: Abstraction has 2211 states and 3245 transitions. [2019-09-20 13:27:45,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3245 transitions. [2019-09-20 13:27:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-20 13:27:45,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,089 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-20 13:27:45,089 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 500095945, now seen corresponding path program 1 times [2019-09-20 13:27:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,206 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-20 13:27:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:45,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,208 INFO L87 Difference]: Start difference. First operand 2211 states and 3245 transitions. Second operand 3 states. [2019-09-20 13:27:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,295 INFO L93 Difference]: Finished difference Result 2476 states and 3630 transitions. [2019-09-20 13:27:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:45,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-09-20 13:27:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,301 INFO L225 Difference]: With dead ends: 2476 [2019-09-20 13:27:45,301 INFO L226 Difference]: Without dead ends: 2476 [2019-09-20 13:27:45,301 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2019-09-20 13:27:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2019-09-20 13:27:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-09-20 13:27:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3630 transitions. [2019-09-20 13:27:45,328 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3630 transitions. Word has length 276 [2019-09-20 13:27:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,328 INFO L475 AbstractCegarLoop]: Abstraction has 2476 states and 3630 transitions. [2019-09-20 13:27:45,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3630 transitions. [2019-09-20 13:27:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-20 13:27:45,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,333 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-20 13:27:45,334 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash 315759838, now seen corresponding path program 1 times [2019-09-20 13:27:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,472 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-20 13:27:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:45,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,474 INFO L87 Difference]: Start difference. First operand 2476 states and 3630 transitions. Second operand 3 states. [2019-09-20 13:27:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,571 INFO L93 Difference]: Finished difference Result 2749 states and 4035 transitions. [2019-09-20 13:27:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:45,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-20 13:27:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,576 INFO L225 Difference]: With dead ends: 2749 [2019-09-20 13:27:45,577 INFO L226 Difference]: Without dead ends: 2749 [2019-09-20 13:27:45,577 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-09-20 13:27:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2019-09-20 13:27:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-09-20 13:27:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4035 transitions. [2019-09-20 13:27:45,609 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4035 transitions. Word has length 315 [2019-09-20 13:27:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,609 INFO L475 AbstractCegarLoop]: Abstraction has 2749 states and 4035 transitions. [2019-09-20 13:27:45,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4035 transitions. [2019-09-20 13:27:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-20 13:27:45,614 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,614 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-20 13:27:45,615 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1897551870, now seen corresponding path program 1 times [2019-09-20 13:27:45,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,861 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-20 13:27:45,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:45,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,863 INFO L87 Difference]: Start difference. First operand 2749 states and 4035 transitions. Second operand 3 states. [2019-09-20 13:27:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,963 INFO L93 Difference]: Finished difference Result 3022 states and 4441 transitions. [2019-09-20 13:27:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:45,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-20 13:27:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,970 INFO L225 Difference]: With dead ends: 3022 [2019-09-20 13:27:45,970 INFO L226 Difference]: Without dead ends: 3022 [2019-09-20 13:27:45,971 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-20 13:27:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2019-09-20 13:27:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2019-09-20 13:27:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4441 transitions. [2019-09-20 13:27:46,004 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4441 transitions. Word has length 356 [2019-09-20 13:27:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,004 INFO L475 AbstractCegarLoop]: Abstraction has 3022 states and 4441 transitions. [2019-09-20 13:27:46,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4441 transitions. [2019-09-20 13:27:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-20 13:27:46,016 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,018 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-20 13:27:46,018 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash 184375628, now seen corresponding path program 1 times [2019-09-20 13:27:46,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,283 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-20 13:27:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:46,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:46,285 INFO L87 Difference]: Start difference. First operand 3022 states and 4441 transitions. Second operand 3 states. [2019-09-20 13:27:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,375 INFO L93 Difference]: Finished difference Result 3288 states and 4827 transitions. [2019-09-20 13:27:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:46,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-20 13:27:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,383 INFO L225 Difference]: With dead ends: 3288 [2019-09-20 13:27:46,383 INFO L226 Difference]: Without dead ends: 3288 [2019-09-20 13:27:46,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-09-20 13:27:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2019-09-20 13:27:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-09-20 13:27:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4827 transitions. [2019-09-20 13:27:46,415 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4827 transitions. Word has length 399 [2019-09-20 13:27:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,415 INFO L475 AbstractCegarLoop]: Abstraction has 3288 states and 4827 transitions. [2019-09-20 13:27:46,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4827 transitions. [2019-09-20 13:27:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-20 13:27:46,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,422 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-20 13:27:46,422 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash 287447201, now seen corresponding path program 1 times [2019-09-20 13:27:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,645 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-20 13:27:46,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:46,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:46,647 INFO L87 Difference]: Start difference. First operand 3288 states and 4827 transitions. Second operand 3 states. [2019-09-20 13:27:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,746 INFO L93 Difference]: Finished difference Result 3561 states and 5235 transitions. [2019-09-20 13:27:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:46,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 439 [2019-09-20 13:27:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,753 INFO L225 Difference]: With dead ends: 3561 [2019-09-20 13:27:46,753 INFO L226 Difference]: Without dead ends: 3561 [2019-09-20 13:27:46,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-09-20 13:27:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3561. [2019-09-20 13:27:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-09-20 13:27:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 5235 transitions. [2019-09-20 13:27:46,791 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 5235 transitions. Word has length 439 [2019-09-20 13:27:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,792 INFO L475 AbstractCegarLoop]: Abstraction has 3561 states and 5235 transitions. [2019-09-20 13:27:46,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 5235 transitions. [2019-09-20 13:27:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-20 13:27:46,802 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,803 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-20 13:27:46,803 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241564, now seen corresponding path program 1 times [2019-09-20 13:27:46,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,120 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-20 13:27:47,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:47,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:47,122 INFO L87 Difference]: Start difference. First operand 3561 states and 5235 transitions. Second operand 3 states. [2019-09-20 13:27:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,243 INFO L93 Difference]: Finished difference Result 3834 states and 5644 transitions. [2019-09-20 13:27:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:47,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-20 13:27:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,252 INFO L225 Difference]: With dead ends: 3834 [2019-09-20 13:27:47,252 INFO L226 Difference]: Without dead ends: 3834 [2019-09-20 13:27:47,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-09-20 13:27:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3834. [2019-09-20 13:27:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3834 states. [2019-09-20 13:27:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 5644 transitions. [2019-09-20 13:27:47,302 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 5644 transitions. Word has length 481 [2019-09-20 13:27:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,303 INFO L475 AbstractCegarLoop]: Abstraction has 3834 states and 5644 transitions. [2019-09-20 13:27:47,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5644 transitions. [2019-09-20 13:27:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-20 13:27:47,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,316 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-20 13:27:47,317 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -652036810, now seen corresponding path program 1 times [2019-09-20 13:27:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,703 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-20 13:27:47,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,706 INFO L87 Difference]: Start difference. First operand 3834 states and 5644 transitions. Second operand 4 states. [2019-09-20 13:27:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,140 INFO L93 Difference]: Finished difference Result 5379 states and 7957 transitions. [2019-09-20 13:27:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 525 [2019-09-20 13:27:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,150 INFO L225 Difference]: With dead ends: 5379 [2019-09-20 13:27:48,150 INFO L226 Difference]: Without dead ends: 5379 [2019-09-20 13:27:48,150 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-09-20 13:27:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4408. [2019-09-20 13:27:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4408 states. [2019-09-20 13:27:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 6694 transitions. [2019-09-20 13:27:48,203 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 6694 transitions. Word has length 525 [2019-09-20 13:27:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,204 INFO L475 AbstractCegarLoop]: Abstraction has 4408 states and 6694 transitions. [2019-09-20 13:27:48,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 6694 transitions. [2019-09-20 13:27:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-20 13:27:48,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,213 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-20 13:27:48,213 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1443846598, now seen corresponding path program 1 times [2019-09-20 13:27:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,662 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-20 13:27:48,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:48,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:48,663 INFO L87 Difference]: Start difference. First operand 4408 states and 6694 transitions. Second operand 3 states. [2019-09-20 13:27:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,748 INFO L93 Difference]: Finished difference Result 4716 states and 7156 transitions. [2019-09-20 13:27:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:48,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 525 [2019-09-20 13:27:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,757 INFO L225 Difference]: With dead ends: 4716 [2019-09-20 13:27:48,757 INFO L226 Difference]: Without dead ends: 4716 [2019-09-20 13:27:48,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-09-20 13:27:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-09-20 13:27:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-09-20 13:27:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 7156 transitions. [2019-09-20 13:27:48,808 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 7156 transitions. Word has length 525 [2019-09-20 13:27:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,808 INFO L475 AbstractCegarLoop]: Abstraction has 4716 states and 7156 transitions. [2019-09-20 13:27:48,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 7156 transitions. [2019-09-20 13:27:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-20 13:27:48,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,819 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-20 13:27:48,819 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1977910766, now seen corresponding path program 1 times [2019-09-20 13:27:48,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,128 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-20 13:27:49,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:49,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:49,130 INFO L87 Difference]: Start difference. First operand 4716 states and 7156 transitions. Second operand 3 states. [2019-09-20 13:27:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,228 INFO L93 Difference]: Finished difference Result 5030 states and 7642 transitions. [2019-09-20 13:27:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:49,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 566 [2019-09-20 13:27:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,238 INFO L225 Difference]: With dead ends: 5030 [2019-09-20 13:27:49,238 INFO L226 Difference]: Without dead ends: 5030 [2019-09-20 13:27:49,238 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2019-09-20 13:27:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 5030. [2019-09-20 13:27:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-09-20 13:27:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 7642 transitions. [2019-09-20 13:27:49,362 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 7642 transitions. Word has length 566 [2019-09-20 13:27:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,362 INFO L475 AbstractCegarLoop]: Abstraction has 5030 states and 7642 transitions. [2019-09-20 13:27:49,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 7642 transitions. [2019-09-20 13:27:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-20 13:27:49,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,373 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-20 13:27:49,373 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1687259843, now seen corresponding path program 1 times [2019-09-20 13:27:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,712 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-20 13:27:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:49,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:49,718 INFO L87 Difference]: Start difference. First operand 5030 states and 7642 transitions. Second operand 3 states. [2019-09-20 13:27:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,813 INFO L93 Difference]: Finished difference Result 5344 states and 8129 transitions. [2019-09-20 13:27:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:49,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-09-20 13:27:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,824 INFO L225 Difference]: With dead ends: 5344 [2019-09-20 13:27:49,824 INFO L226 Difference]: Without dead ends: 5344 [2019-09-20 13:27:49,824 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-09-20 13:27:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2019-09-20 13:27:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-09-20 13:27:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8129 transitions. [2019-09-20 13:27:49,880 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 8129 transitions. Word has length 609 [2019-09-20 13:27:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,880 INFO L475 AbstractCegarLoop]: Abstraction has 5344 states and 8129 transitions. [2019-09-20 13:27:49,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 8129 transitions. [2019-09-20 13:27:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-20 13:27:49,893 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,894 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-20 13:27:49,894 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1046145108, now seen corresponding path program 1 times [2019-09-20 13:27:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,435 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-20 13:27:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:50,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,441 INFO L87 Difference]: Start difference. First operand 5344 states and 8129 transitions. Second operand 3 states. [2019-09-20 13:27:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,542 INFO L93 Difference]: Finished difference Result 5653 states and 8592 transitions. [2019-09-20 13:27:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:50,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2019-09-20 13:27:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,555 INFO L225 Difference]: With dead ends: 5653 [2019-09-20 13:27:50,555 INFO L226 Difference]: Without dead ends: 5653 [2019-09-20 13:27:50,556 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-09-20 13:27:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5653. [2019-09-20 13:27:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-09-20 13:27:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8592 transitions. [2019-09-20 13:27:50,613 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8592 transitions. Word has length 654 [2019-09-20 13:27:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,614 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8592 transitions. [2019-09-20 13:27:50,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8592 transitions. [2019-09-20 13:27:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-20 13:27:50,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,627 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-20 13:27:50,627 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash -354222234, now seen corresponding path program 1 times [2019-09-20 13:27:50,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat