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.15.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:50,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:50,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:50,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:50,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:50,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:50,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:50,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:50,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:50,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:50,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:50,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:50,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:50,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:50,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:50,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:50,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:50,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:50,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:50,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:50,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:50,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:50,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:50,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:50,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:50,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:50,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:50,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:50,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:50,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:50,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:50,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:50,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:50,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:50,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:50,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:50,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:50,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:50,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:50,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:50,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:50,509 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-09 05:54:50,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:50,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:50,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:50,535 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:50,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:50,536 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:50,536 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:50,536 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:50,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:50,536 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:50,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:50,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:50,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:50,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:50,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:50,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:50,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:50,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:50,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:50,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:50,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:50,539 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:50,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:50,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:50,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:50,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:50,540 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:50,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:50,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:50,541 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:50,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:50,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:50,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:50,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:50,593 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:50,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-09 05:54:50,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42bd8c33/4ff43cd582c84b9daebbfc6cebd111e3/FLAG0e7e3ea86 [2019-09-09 05:54:51,276 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:51,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-09 05:54:51,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42bd8c33/4ff43cd582c84b9daebbfc6cebd111e3/FLAG0e7e3ea86 [2019-09-09 05:54:51,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42bd8c33/4ff43cd582c84b9daebbfc6cebd111e3 [2019-09-09 05:54:51,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:51,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:51,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:51,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:51,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:51,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:51" (1/1) ... [2019-09-09 05:54:51,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a326d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:51, skipping insertion in model container [2019-09-09 05:54:51,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:51" (1/1) ... [2019-09-09 05:54:51,577 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:51,654 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:52,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:52,238 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:52,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:52,438 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:52,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52 WrapperNode [2019-09-09 05:54:52,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:52,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:52,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:52,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:52,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (1/1) ... [2019-09-09 05:54:52,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:52,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:52,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:52,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:52,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (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-09 05:54:52,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:52,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:52,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:52,722 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:52,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:52,724 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:53,536 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:54,277 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:54,277 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:54,303 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:54,304 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:54,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:54 BoogieIcfgContainer [2019-09-09 05:54:54,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:54,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:54,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:54,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:54,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:51" (1/3) ... [2019-09-09 05:54:54,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a08f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:54, skipping insertion in model container [2019-09-09 05:54:54,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:52" (2/3) ... [2019-09-09 05:54:54,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a08f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:54, skipping insertion in model container [2019-09-09 05:54:54,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:54" (3/3) ... [2019-09-09 05:54:54,312 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-09-09 05:54:54,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:54,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:54,348 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:54,370 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:54,370 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:54,370 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:54,370 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:54,370 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:54,371 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:54,371 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:54,371 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-09 05:54:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:54:54,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,402 INFO L399 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] [2019-09-09 05:54:54,405 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1890042678, now seen corresponding path program 1 times [2019-09-09 05:54:54,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,782 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-09 05:54:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,810 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-09-09 05:54:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,225 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-09-09 05:54:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-09 05:54:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,240 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:54:55,240 INFO L226 Difference]: Without dead ends: 172 [2019-09-09 05:54:55,242 INFO L628 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-09 05:54:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-09 05:54:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-09 05:54:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-09 05:54:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-09-09 05:54:55,294 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 49 [2019-09-09 05:54:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,294 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-09-09 05:54:55,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-09-09 05:54:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:55,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,298 INFO L399 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] [2019-09-09 05:54:55,299 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1217836546, now seen corresponding path program 1 times [2019-09-09 05:54:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,452 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-09 05:54:55,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,459 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-09-09 05:54:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,856 INFO L93 Difference]: Finished difference Result 172 states and 258 transitions. [2019-09-09 05:54:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,859 INFO L225 Difference]: With dead ends: 172 [2019-09-09 05:54:55,859 INFO L226 Difference]: Without dead ends: 172 [2019-09-09 05:54:55,860 INFO L628 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-09 05:54:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-09 05:54:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-09 05:54:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-09 05:54:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-09-09 05:54:55,880 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 62 [2019-09-09 05:54:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,881 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-09-09 05:54:55,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-09-09 05:54:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:55,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,886 INFO L399 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] [2019-09-09 05:54:55,888 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -947267054, now seen corresponding path program 1 times [2019-09-09 05:54:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,013 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-09 05:54:56,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,015 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-09-09 05:54:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,336 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2019-09-09 05:54:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,338 INFO L225 Difference]: With dead ends: 171 [2019-09-09 05:54:56,338 INFO L226 Difference]: Without dead ends: 171 [2019-09-09 05:54:56,339 INFO L628 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-09 05:54:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-09 05:54:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-09-09 05:54:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-09 05:54:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-09-09 05:54:56,358 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 63 [2019-09-09 05:54:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,359 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-09-09 05:54:56,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-09-09 05:54:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:56,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,362 INFO L399 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] [2019-09-09 05:54:56,362 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 939636390, now seen corresponding path program 1 times [2019-09-09 05:54:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,439 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-09 05:54:56,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:56,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:56,441 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 5 states. [2019-09-09 05:54:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,948 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2019-09-09 05:54:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:56,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:54:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,951 INFO L225 Difference]: With dead ends: 176 [2019-09-09 05:54:56,951 INFO L226 Difference]: Without dead ends: 176 [2019-09-09 05:54:56,952 INFO L628 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-09 05:54:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-09 05:54:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-09 05:54:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2019-09-09 05:54:56,962 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 63 [2019-09-09 05:54:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,963 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2019-09-09 05:54:56,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2019-09-09 05:54:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:56,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,966 INFO L399 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] [2019-09-09 05:54:56,966 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2122203230, now seen corresponding path program 1 times [2019-09-09 05:54:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,024 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-09 05:54:57,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,026 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2019-09-09 05:54:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,306 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-09 05:54:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,310 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:57,310 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:54:57,310 INFO L628 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-09 05:54:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:54:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2019-09-09 05:54:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2019-09-09 05:54:57,317 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 63 [2019-09-09 05:54:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,318 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2019-09-09 05:54:57,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2019-09-09 05:54:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:57,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,319 INFO L399 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] [2019-09-09 05:54:57,320 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2054643229, now seen corresponding path program 1 times [2019-09-09 05:54:57,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,394 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-09 05:54:57,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,397 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2019-09-09 05:54:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,658 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2019-09-09 05:54:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,660 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:54:57,660 INFO L226 Difference]: Without dead ends: 188 [2019-09-09 05:54:57,661 INFO L628 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-09 05:54:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-09 05:54:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-09 05:54:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2019-09-09 05:54:57,671 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 63 [2019-09-09 05:54:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,672 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2019-09-09 05:54:57,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2019-09-09 05:54:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:57,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,673 INFO L399 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] [2019-09-09 05:54:57,673 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1184518913, now seen corresponding path program 1 times [2019-09-09 05:54:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,737 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-09 05:54:57,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,739 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2019-09-09 05:54:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,022 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-09 05:54:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,024 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:54:58,024 INFO L226 Difference]: Without dead ends: 188 [2019-09-09 05:54:58,024 INFO L628 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-09 05:54:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-09 05:54:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-09 05:54:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2019-09-09 05:54:58,030 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 64 [2019-09-09 05:54:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,030 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2019-09-09 05:54:58,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2019-09-09 05:54:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:58,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,031 INFO L399 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] [2019-09-09 05:54:58,031 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash 927095706, now seen corresponding path program 1 times [2019-09-09 05:54:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,093 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-09 05:54:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,095 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2019-09-09 05:54:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,381 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2019-09-09 05:54:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,385 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:54:58,385 INFO L226 Difference]: Without dead ends: 188 [2019-09-09 05:54:58,385 INFO L628 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-09 05:54:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-09 05:54:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-09 05:54:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2019-09-09 05:54:58,396 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 65 [2019-09-09 05:54:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,396 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2019-09-09 05:54:58,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2019-09-09 05:54:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:58,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,397 INFO L399 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] [2019-09-09 05:54:58,397 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1779390022, now seen corresponding path program 1 times [2019-09-09 05:54:58,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,452 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-09 05:54:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,454 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2019-09-09 05:54:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,702 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2019-09-09 05:54:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,704 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:54:58,704 INFO L226 Difference]: Without dead ends: 188 [2019-09-09 05:54:58,704 INFO L628 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-09 05:54:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-09 05:54:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-09 05:54:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:54:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2019-09-09 05:54:58,710 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 66 [2019-09-09 05:54:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,710 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-09-09 05:54:58,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2019-09-09 05:54:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:58,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,712 INFO L399 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] [2019-09-09 05:54:58,712 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1997488103, now seen corresponding path program 1 times [2019-09-09 05:54:58,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,775 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-09 05:54:58,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,777 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand 4 states. [2019-09-09 05:54:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,089 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2019-09-09 05:54:59,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,091 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:59,092 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:59,092 INFO L628 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-09 05:54:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-09 05:54:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:54:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2019-09-09 05:54:59,098 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 66 [2019-09-09 05:54:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,098 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2019-09-09 05:54:59,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2019-09-09 05:54:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:54:59,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,099 INFO L399 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] [2019-09-09 05:54:59,100 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 771836149, now seen corresponding path program 1 times [2019-09-09 05:54:59,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,157 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-09 05:54:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,159 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2019-09-09 05:54:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,438 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-09-09 05:54:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:54:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,440 INFO L225 Difference]: With dead ends: 200 [2019-09-09 05:54:59,441 INFO L226 Difference]: Without dead ends: 200 [2019-09-09 05:54:59,441 INFO L628 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-09 05:54:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-09 05:54:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-09-09 05:54:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:54:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2019-09-09 05:54:59,447 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 67 [2019-09-09 05:54:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,447 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2019-09-09 05:54:59,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2019-09-09 05:54:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:59,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,449 INFO L399 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] [2019-09-09 05:54:59,449 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash -677623021, now seen corresponding path program 1 times [2019-09-09 05:54:59,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,533 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-09 05:54:59,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,536 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2019-09-09 05:54:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,884 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-09 05:54:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,887 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:54:59,887 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:54:59,887 INFO L628 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-09 05:54:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:54:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-09 05:54:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:54:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-09-09 05:54:59,893 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 79 [2019-09-09 05:54:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,893 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-09-09 05:54:59,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-09-09 05:54:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:59,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,894 INFO L399 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] [2019-09-09 05:54:59,895 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash -802468499, now seen corresponding path program 1 times [2019-09-09 05:54:59,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,972 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-09 05:54:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,974 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2019-09-09 05:55:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,245 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-09 05:55:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:55:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,247 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:55:00,247 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:55:00,248 INFO L628 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-09 05:55:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:55:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2019-09-09 05:55:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2019-09-09 05:55:00,253 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 80 [2019-09-09 05:55:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,253 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2019-09-09 05:55:00,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2019-09-09 05:55:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:55:00,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,255 INFO L399 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] [2019-09-09 05:55:00,255 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash -870028500, now seen corresponding path program 1 times [2019-09-09 05:55:00,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,306 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-09 05:55:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,307 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2019-09-09 05:55:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,582 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2019-09-09 05:55:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:55:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,584 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:55:00,584 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:55:00,585 INFO L628 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-09 05:55:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:55:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-09 05:55:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2019-09-09 05:55:00,590 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 80 [2019-09-09 05:55:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,590 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2019-09-09 05:55:00,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2019-09-09 05:55:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:55:00,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,592 INFO L399 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] [2019-09-09 05:55:00,592 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1655029296, now seen corresponding path program 1 times [2019-09-09 05:55:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,658 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-09 05:55:00,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,660 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2019-09-09 05:55:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,950 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-09 05:55:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:55:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,954 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:55:00,954 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:55:00,955 INFO L628 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-09 05:55:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:55:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-09 05:55:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2019-09-09 05:55:00,965 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2019-09-09 05:55:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,965 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2019-09-09 05:55:00,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2019-09-09 05:55:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:55:00,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,967 INFO L399 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] [2019-09-09 05:55:00,967 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -773824279, now seen corresponding path program 1 times [2019-09-09 05:55:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,032 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-09 05:55:01,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,036 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2019-09-09 05:55:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,287 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2019-09-09 05:55:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:55:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,289 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:55:01,289 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:55:01,289 INFO L628 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-09 05:55:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:55:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-09 05:55:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2019-09-09 05:55:01,294 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 82 [2019-09-09 05:55:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,295 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2019-09-09 05:55:01,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2019-09-09 05:55:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:55:01,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,296 INFO L399 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] [2019-09-09 05:55:01,297 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1326665291, now seen corresponding path program 1 times [2019-09-09 05:55:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,350 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-09 05:55:01,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,351 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2019-09-09 05:55:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,694 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2019-09-09 05:55:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:55:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,697 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:55:01,697 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:55:01,698 INFO L628 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-09 05:55:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:55:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-09 05:55:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-09-09 05:55:01,708 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 83 [2019-09-09 05:55:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,708 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-09-09 05:55:01,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-09-09 05:55:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:55:01,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,710 INFO L399 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] [2019-09-09 05:55:01,710 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1724696956, now seen corresponding path program 1 times [2019-09-09 05:55:01,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,819 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-09 05:55:01,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,821 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2019-09-09 05:55:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,082 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2019-09-09 05:55:02,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:55:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,084 INFO L225 Difference]: With dead ends: 204 [2019-09-09 05:55:02,084 INFO L226 Difference]: Without dead ends: 204 [2019-09-09 05:55:02,084 INFO L628 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-09 05:55:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-09 05:55:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2019-09-09 05:55:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-09 05:55:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-09-09 05:55:02,110 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 84 [2019-09-09 05:55:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,110 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-09-09 05:55:02,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-09-09 05:55:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:55:02,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,112 INFO L399 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] [2019-09-09 05:55:02,113 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash 254389468, now seen corresponding path program 1 times [2019-09-09 05:55:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,185 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-09 05:55:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,186 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2019-09-09 05:55:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,564 INFO L93 Difference]: Finished difference Result 305 states and 452 transitions. [2019-09-09 05:55:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:55:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,567 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:55:02,567 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:55:02,568 INFO L628 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-09 05:55:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:55:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2019-09-09 05:55:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-09 05:55:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2019-09-09 05:55:02,574 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 88 [2019-09-09 05:55:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,575 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2019-09-09 05:55:02,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2019-09-09 05:55:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:55:02,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,576 INFO L399 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] [2019-09-09 05:55:02,577 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 678036190, now seen corresponding path program 1 times [2019-09-09 05:55:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,650 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-09 05:55:02,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,652 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2019-09-09 05:55:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,991 INFO L93 Difference]: Finished difference Result 286 states and 431 transitions. [2019-09-09 05:55:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:55:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,994 INFO L225 Difference]: With dead ends: 286 [2019-09-09 05:55:02,994 INFO L226 Difference]: Without dead ends: 286 [2019-09-09 05:55:02,994 INFO L628 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-09 05:55:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-09 05:55:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2019-09-09 05:55:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:55:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2019-09-09 05:55:03,000 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 88 [2019-09-09 05:55:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,001 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2019-09-09 05:55:03,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2019-09-09 05:55:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:55:03,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,002 INFO L399 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] [2019-09-09 05:55:03,002 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1640143096, now seen corresponding path program 1 times [2019-09-09 05:55:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,069 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-09 05:55:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,071 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2019-09-09 05:55:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,489 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2019-09-09 05:55:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:55:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,492 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:55:03,492 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:55:03,492 INFO L628 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-09 05:55:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:55:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-09 05:55:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-09-09 05:55:03,498 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 89 [2019-09-09 05:55:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,499 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-09-09 05:55:03,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-09-09 05:55:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:55:03,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,501 INFO L399 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] [2019-09-09 05:55:03,501 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1372359888, now seen corresponding path program 1 times [2019-09-09 05:55:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,580 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-09 05:55:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,582 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-09-09 05:55:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,103 INFO L93 Difference]: Finished difference Result 321 states and 480 transitions. [2019-09-09 05:55:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:55:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,107 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:55:04,107 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:55:04,107 INFO L628 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-09 05:55:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:55:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-09 05:55:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-09-09 05:55:04,118 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 101 [2019-09-09 05:55:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,118 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-09-09 05:55:04,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-09-09 05:55:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:55:04,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,121 INFO L399 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] [2019-09-09 05:55:04,121 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -496340882, now seen corresponding path program 1 times [2019-09-09 05:55:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,211 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-09 05:55:04,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,213 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-09-09 05:55:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,510 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2019-09-09 05:55:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:55:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,512 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:55:04,512 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:55:04,512 INFO L628 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-09 05:55:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:55:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-09 05:55:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-09-09 05:55:04,519 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 101 [2019-09-09 05:55:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,520 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-09-09 05:55:04,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-09-09 05:55:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:04,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,521 INFO L399 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] [2019-09-09 05:55:04,521 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash -864474896, now seen corresponding path program 1 times [2019-09-09 05:55:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,595 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-09 05:55:04,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,599 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-09-09 05:55:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,991 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-09-09 05:55:04,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,995 INFO L225 Difference]: With dead ends: 320 [2019-09-09 05:55:04,995 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 05:55:04,996 INFO L628 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-09 05:55:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 05:55:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-09 05:55:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-09-09 05:55:05,002 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 102 [2019-09-09 05:55:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,003 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-09-09 05:55:05,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-09-09 05:55:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:05,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,004 INFO L399 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] [2019-09-09 05:55:05,004 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash -932034897, now seen corresponding path program 1 times [2019-09-09 05:55:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,067 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-09 05:55:05,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,069 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-09-09 05:55:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,585 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-09-09 05:55:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,589 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:05,589 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:05,590 INFO L628 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-09 05:55:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-09 05:55:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-09-09 05:55:05,599 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 102 [2019-09-09 05:55:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,600 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-09-09 05:55:05,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-09-09 05:55:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:05,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,603 INFO L399 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] [2019-09-09 05:55:05,603 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash 522310514, now seen corresponding path program 1 times [2019-09-09 05:55:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,688 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-09 05:55:05,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:05,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:05,691 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-09-09 05:55:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,023 INFO L93 Difference]: Finished difference Result 286 states and 426 transitions. [2019-09-09 05:55:06,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,025 INFO L225 Difference]: With dead ends: 286 [2019-09-09 05:55:06,026 INFO L226 Difference]: Without dead ends: 286 [2019-09-09 05:55:06,026 INFO L628 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-09 05:55:06,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-09 05:55:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2019-09-09 05:55:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-09-09 05:55:06,034 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 102 [2019-09-09 05:55:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,034 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-09-09 05:55:06,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-09-09 05:55:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:06,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,036 INFO L399 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] [2019-09-09 05:55:06,036 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash 454750513, now seen corresponding path program 1 times [2019-09-09 05:55:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,100 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-09 05:55:06,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,101 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-09-09 05:55:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,362 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-09 05:55:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,368 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:55:06,368 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:55:06,368 INFO L628 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-09 05:55:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:55:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-09 05:55:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-09-09 05:55:06,377 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 102 [2019-09-09 05:55:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,378 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-09-09 05:55:06,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-09-09 05:55:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:55:06,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,379 INFO L399 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] [2019-09-09 05:55:06,380 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 717739693, now seen corresponding path program 1 times [2019-09-09 05:55:06,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,430 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-09 05:55:06,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,432 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-09-09 05:55:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:06,795 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-09 05:55:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:06,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:06,797 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:06,797 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:06,798 INFO L628 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-09 05:55:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-09 05:55:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-09-09 05:55:06,804 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 103 [2019-09-09 05:55:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:06,804 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-09-09 05:55:06,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-09-09 05:55:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:55:06,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:06,806 INFO L399 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] [2019-09-09 05:55:06,806 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash 758414443, now seen corresponding path program 1 times [2019-09-09 05:55:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:06,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:06,912 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-09 05:55:06,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:06,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:06,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:06,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:06,914 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-09-09 05:55:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,192 INFO L93 Difference]: Finished difference Result 284 states and 421 transitions. [2019-09-09 05:55:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,194 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:55:07,194 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:55:07,195 INFO L628 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-09 05:55:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:55:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-09 05:55:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-09-09 05:55:07,206 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 103 [2019-09-09 05:55:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,206 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-09-09 05:55:07,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-09-09 05:55:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:07,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,209 INFO L399 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] [2019-09-09 05:55:07,210 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash -232429652, now seen corresponding path program 1 times [2019-09-09 05:55:07,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,289 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-09 05:55:07,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:07,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:07,292 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-09-09 05:55:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,698 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-09 05:55:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:07,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,702 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:07,702 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:07,702 INFO L628 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-09 05:55:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-09 05:55:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-09-09 05:55:07,710 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 104 [2019-09-09 05:55:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,710 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-09-09 05:55:07,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-09-09 05:55:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:07,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,712 INFO L399 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] [2019-09-09 05:55:07,713 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1028487598, now seen corresponding path program 1 times [2019-09-09 05:55:07,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,804 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-09 05:55:07,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:07,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:07,807 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2019-09-09 05:55:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,177 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2019-09-09 05:55:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,180 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:55:08,180 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:55:08,180 INFO L628 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-09 05:55:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:55:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-09 05:55:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2019-09-09 05:55:08,186 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 104 [2019-09-09 05:55:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,186 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2019-09-09 05:55:08,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2019-09-09 05:55:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:08,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,187 INFO L399 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] [2019-09-09 05:55:08,188 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash 930029544, now seen corresponding path program 1 times [2019-09-09 05:55:08,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,272 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-09 05:55:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,274 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2019-09-09 05:55:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,661 INFO L93 Difference]: Finished difference Result 318 states and 467 transitions. [2019-09-09 05:55:08,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,664 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:55:08,664 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:55:08,665 INFO L628 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-09 05:55:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:55:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-09 05:55:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2019-09-09 05:55:08,674 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 105 [2019-09-09 05:55:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,674 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2019-09-09 05:55:08,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2019-09-09 05:55:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:08,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,677 INFO L399 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] [2019-09-09 05:55:08,677 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1363758630, now seen corresponding path program 1 times [2019-09-09 05:55:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,753 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-09 05:55:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,758 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2019-09-09 05:55:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,068 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2019-09-09 05:55:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,070 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:55:09,070 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:55:09,071 INFO L628 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-09 05:55:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:55:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-09 05:55:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2019-09-09 05:55:09,077 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 105 [2019-09-09 05:55:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,077 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2019-09-09 05:55:09,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2019-09-09 05:55:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:09,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,078 INFO L399 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] [2019-09-09 05:55:09,079 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1135503225, now seen corresponding path program 1 times [2019-09-09 05:55:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,140 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-09 05:55:09,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,141 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2019-09-09 05:55:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,517 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2019-09-09 05:55:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,520 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:55:09,521 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:55:09,521 INFO L628 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-09 05:55:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:55:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-09 05:55:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2019-09-09 05:55:09,527 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 106 [2019-09-09 05:55:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,528 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2019-09-09 05:55:09,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2019-09-09 05:55:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:09,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,529 INFO L399 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] [2019-09-09 05:55:09,529 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash -574803447, now seen corresponding path program 1 times [2019-09-09 05:55:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,586 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-09 05:55:09,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,587 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2019-09-09 05:55:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,849 INFO L93 Difference]: Finished difference Result 274 states and 403 transitions. [2019-09-09 05:55:09,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,852 INFO L225 Difference]: With dead ends: 274 [2019-09-09 05:55:09,852 INFO L226 Difference]: Without dead ends: 274 [2019-09-09 05:55:09,852 INFO L628 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-09 05:55:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-09 05:55:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2019-09-09 05:55:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2019-09-09 05:55:09,858 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 106 [2019-09-09 05:55:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,859 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2019-09-09 05:55:09,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2019-09-09 05:55:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:09,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,860 INFO L399 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] [2019-09-09 05:55:09,860 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1961804019, now seen corresponding path program 1 times [2019-09-09 05:55:09,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,927 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-09 05:55:09,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,928 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2019-09-09 05:55:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,290 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2019-09-09 05:55:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:55:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,292 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:55:10,292 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:55:10,292 INFO L628 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-09 05:55:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:55:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-09 05:55:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:55:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2019-09-09 05:55:10,299 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 110 [2019-09-09 05:55:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,300 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2019-09-09 05:55:10,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2019-09-09 05:55:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:10,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,301 INFO L399 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] [2019-09-09 05:55:10,301 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1544407413, now seen corresponding path program 1 times [2019-09-09 05:55:10,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,375 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-09 05:55:10,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,377 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 4 states. [2019-09-09 05:55:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,707 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-09 05:55:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:55:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,710 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:55:10,710 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:55:10,710 INFO L628 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-09 05:55:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:55:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-09 05:55:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-09 05:55:10,716 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 110 [2019-09-09 05:55:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,717 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-09 05:55:10,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-09 05:55:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:55:10,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,718 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:10,719 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 193721619, now seen corresponding path program 1 times [2019-09-09 05:55:10,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:10,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,791 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 4 states. [2019-09-09 05:55:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,178 INFO L93 Difference]: Finished difference Result 334 states and 495 transitions. [2019-09-09 05:55:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-09 05:55:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,181 INFO L225 Difference]: With dead ends: 334 [2019-09-09 05:55:11,181 INFO L226 Difference]: Without dead ends: 334 [2019-09-09 05:55:11,181 INFO L628 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-09 05:55:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-09 05:55:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2019-09-09 05:55:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2019-09-09 05:55:11,187 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 113 [2019-09-09 05:55:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,188 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2019-09-09 05:55:11,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2019-09-09 05:55:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:55:11,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,189 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:11,189 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash 938446418, now seen corresponding path program 1 times [2019-09-09 05:55:11,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:11,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,262 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand 4 states. [2019-09-09 05:55:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,599 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2019-09-09 05:55:11,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:55:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,603 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:55:11,603 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:55:11,604 INFO L628 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-09 05:55:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:55:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-09 05:55:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 430 transitions. [2019-09-09 05:55:11,609 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 430 transitions. Word has length 114 [2019-09-09 05:55:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,610 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 430 transitions. [2019-09-09 05:55:11,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 430 transitions. [2019-09-09 05:55:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:55:11,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,611 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:11,611 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash -498124115, now seen corresponding path program 1 times [2019-09-09 05:55:11,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:11,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,701 INFO L87 Difference]: Start difference. First operand 289 states and 430 transitions. Second operand 4 states. [2019-09-09 05:55:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,034 INFO L93 Difference]: Finished difference Result 326 states and 480 transitions. [2019-09-09 05:55:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:55:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,037 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:55:12,037 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:55:12,037 INFO L628 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-09 05:55:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:55:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-09 05:55:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2019-09-09 05:55:12,042 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 115 [2019-09-09 05:55:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,043 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2019-09-09 05:55:12,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2019-09-09 05:55:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:12,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,044 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-09 05:55:12,045 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -9995480, now seen corresponding path program 1 times [2019-09-09 05:55:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:12,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,115 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand 4 states. [2019-09-09 05:55:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,442 INFO L93 Difference]: Finished difference Result 326 states and 479 transitions. [2019-09-09 05:55:12,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,445 INFO L225 Difference]: With dead ends: 326 [2019-09-09 05:55:12,445 INFO L226 Difference]: Without dead ends: 326 [2019-09-09 05:55:12,446 INFO L628 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-09 05:55:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-09 05:55:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-09 05:55:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2019-09-09 05:55:12,451 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 116 [2019-09-09 05:55:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,452 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2019-09-09 05:55:12,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2019-09-09 05:55:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:12,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,453 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:12,454 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 594719628, now seen corresponding path program 1 times [2019-09-09 05:55:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:12,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,609 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand 4 states. [2019-09-09 05:55:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,950 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2019-09-09 05:55:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,951 INFO L225 Difference]: With dead ends: 324 [2019-09-09 05:55:12,951 INFO L226 Difference]: Without dead ends: 324 [2019-09-09 05:55:12,952 INFO L628 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-09 05:55:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-09 05:55:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 289. [2019-09-09 05:55:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2019-09-09 05:55:12,957 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 116 [2019-09-09 05:55:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,957 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2019-09-09 05:55:12,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2019-09-09 05:55:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:55:12,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,958 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2019-09-09 05:55:12,958 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash -179022615, now seen corresponding path program 1 times [2019-09-09 05:55:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,033 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand 4 states. [2019-09-09 05:55:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,331 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2019-09-09 05:55:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:55:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,334 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:55:13,334 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:55:13,334 INFO L628 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-09 05:55:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:55:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 289. [2019-09-09 05:55:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2019-09-09 05:55:13,339 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 117 [2019-09-09 05:55:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,340 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2019-09-09 05:55:13,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2019-09-09 05:55:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:55:13,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,341 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:13,341 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1648380811, now seen corresponding path program 1 times [2019-09-09 05:55:13,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:13,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,419 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand 4 states. [2019-09-09 05:55:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,727 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-09 05:55:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:55:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,729 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:55:13,729 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:55:13,729 INFO L628 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-09 05:55:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:55:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-09 05:55:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2019-09-09 05:55:13,734 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 117 [2019-09-09 05:55:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,735 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2019-09-09 05:55:13,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2019-09-09 05:55:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-09 05:55:13,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,737 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:13,737 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash -894819603, now seen corresponding path program 1 times [2019-09-09 05:55:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:13,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,818 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand 4 states. [2019-09-09 05:55:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,135 INFO L93 Difference]: Finished difference Result 319 states and 466 transitions. [2019-09-09 05:55:14,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-09 05:55:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,137 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:55:14,137 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:55:14,137 INFO L628 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-09 05:55:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:55:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-09 05:55:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2019-09-09 05:55:14,142 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 119 [2019-09-09 05:55:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,142 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2019-09-09 05:55:14,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2019-09-09 05:55:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:55:14,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,144 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:14,144 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1214178959, now seen corresponding path program 1 times [2019-09-09 05:55:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:14,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,225 INFO L87 Difference]: Start difference. First operand 289 states and 424 transitions. Second operand 4 states. [2019-09-09 05:55:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,540 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-09 05:55:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:55:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,543 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:55:14,543 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:55:14,543 INFO L628 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-09 05:55:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:55:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-09 05:55:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2019-09-09 05:55:14,552 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 120 [2019-09-09 05:55:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,552 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2019-09-09 05:55:14,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2019-09-09 05:55:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:55:14,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,553 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:14,554 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash -568746750, now seen corresponding path program 1 times [2019-09-09 05:55:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:14,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,619 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2019-09-09 05:55:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,916 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-09 05:55:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:55:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,918 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:55:14,918 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:55:14,918 INFO L628 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-09 05:55:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:55:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-09 05:55:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2019-09-09 05:55:14,923 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 120 [2019-09-09 05:55:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,924 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2019-09-09 05:55:14,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2019-09-09 05:55:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:55:14,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,925 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:14,925 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash 792898142, now seen corresponding path program 1 times [2019-09-09 05:55:14,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:15,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,002 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand 4 states. [2019-09-09 05:55:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,301 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2019-09-09 05:55:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:55:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,303 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:55:15,303 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:55:15,304 INFO L628 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-09 05:55:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:55:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-09 05:55:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2019-09-09 05:55:15,309 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 121 [2019-09-09 05:55:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,310 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2019-09-09 05:55:15,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2019-09-09 05:55:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:55:15,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,311 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:15,311 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1650988349, now seen corresponding path program 1 times [2019-09-09 05:55:15,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:15,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,407 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 4 states. [2019-09-09 05:55:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,731 INFO L93 Difference]: Finished difference Result 313 states and 455 transitions. [2019-09-09 05:55:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:55:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,734 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:55:15,734 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:55:15,734 INFO L628 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-09 05:55:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:55:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-09 05:55:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2019-09-09 05:55:15,739 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 122 [2019-09-09 05:55:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,739 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2019-09-09 05:55:15,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2019-09-09 05:55:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:15,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,740 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:15,741 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1396412679, now seen corresponding path program 1 times [2019-09-09 05:55:15,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,820 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand 4 states. [2019-09-09 05:55:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,140 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2019-09-09 05:55:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,142 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:55:16,142 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:55:16,142 INFO L628 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-09 05:55:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:55:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2019-09-09 05:55:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-09 05:55:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2019-09-09 05:55:16,147 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 123 [2019-09-09 05:55:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,147 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2019-09-09 05:55:16,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2019-09-09 05:55:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:16,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,149 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:55:16,149 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1284876489, now seen corresponding path program 1 times [2019-09-09 05:55:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-09 05:55:16,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,230 INFO L87 Difference]: Start difference. First operand 289 states and 419 transitions. Second operand 4 states. [2019-09-09 05:55:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,627 INFO L93 Difference]: Finished difference Result 360 states and 528 transitions. [2019-09-09 05:55:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,631 INFO L225 Difference]: With dead ends: 360 [2019-09-09 05:55:16,631 INFO L226 Difference]: Without dead ends: 360 [2019-09-09 05:55:16,631 INFO L628 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-09 05:55:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-09 05:55:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 321. [2019-09-09 05:55:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-09 05:55:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 476 transitions. [2019-09-09 05:55:16,636 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 476 transitions. Word has length 123 [2019-09-09 05:55:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,636 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 476 transitions. [2019-09-09 05:55:16,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 476 transitions. [2019-09-09 05:55:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:55:16,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,638 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-09 05:55:16,638 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1847510473, now seen corresponding path program 1 times [2019-09-09 05:55:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:16,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,707 INFO L87 Difference]: Start difference. First operand 321 states and 476 transitions. Second operand 4 states. [2019-09-09 05:55:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,129 INFO L93 Difference]: Finished difference Result 427 states and 639 transitions. [2019-09-09 05:55:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:55:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,132 INFO L225 Difference]: With dead ends: 427 [2019-09-09 05:55:17,133 INFO L226 Difference]: Without dead ends: 427 [2019-09-09 05:55:17,133 INFO L628 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-09 05:55:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-09 05:55:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 360. [2019-09-09 05:55:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-09 05:55:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-09-09 05:55:17,138 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 124 [2019-09-09 05:55:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,138 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-09-09 05:55:17,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-09-09 05:55:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:55:17,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,140 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:55:17,140 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1110059788, now seen corresponding path program 1 times [2019-09-09 05:55:17,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:17,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,201 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-09-09 05:55:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,493 INFO L93 Difference]: Finished difference Result 386 states and 579 transitions. [2019-09-09 05:55:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:55:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,497 INFO L225 Difference]: With dead ends: 386 [2019-09-09 05:55:17,497 INFO L226 Difference]: Without dead ends: 386 [2019-09-09 05:55:17,497 INFO L628 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-09 05:55:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-09 05:55:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2019-09-09 05:55:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-09 05:55:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2019-09-09 05:55:17,501 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 125 [2019-09-09 05:55:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,502 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2019-09-09 05:55:17,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2019-09-09 05:55:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:55:17,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,504 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-09-09 05:55:17,504 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash -512713301, now seen corresponding path program 1 times [2019-09-09 05:55:17,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,581 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 4 states. [2019-09-09 05:55:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,981 INFO L93 Difference]: Finished difference Result 419 states and 626 transitions. [2019-09-09 05:55:17,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:55:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,984 INFO L225 Difference]: With dead ends: 419 [2019-09-09 05:55:17,984 INFO L226 Difference]: Without dead ends: 419 [2019-09-09 05:55:17,984 INFO L628 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-09 05:55:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-09 05:55:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2019-09-09 05:55:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-09 05:55:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2019-09-09 05:55:17,988 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 125 [2019-09-09 05:55:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,989 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2019-09-09 05:55:17,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2019-09-09 05:55:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:55:17,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,990 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:55:17,991 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1059638715, now seen corresponding path program 1 times [2019-09-09 05:55:17,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:18,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,061 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2019-09-09 05:55:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,344 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-09-09 05:55:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:55:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,346 INFO L225 Difference]: With dead ends: 385 [2019-09-09 05:55:18,346 INFO L226 Difference]: Without dead ends: 385 [2019-09-09 05:55:18,347 INFO L628 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-09 05:55:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-09 05:55:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-09 05:55:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-09 05:55:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2019-09-09 05:55:18,351 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 126 [2019-09-09 05:55:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,352 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2019-09-09 05:55:18,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2019-09-09 05:55:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:55:18,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,353 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:55:18,354 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1056352367, now seen corresponding path program 1 times [2019-09-09 05:55:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:18,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,448 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2019-09-09 05:55:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,726 INFO L93 Difference]: Finished difference Result 385 states and 576 transitions. [2019-09-09 05:55:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:55:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,728 INFO L225 Difference]: With dead ends: 385 [2019-09-09 05:55:18,729 INFO L226 Difference]: Without dead ends: 385 [2019-09-09 05:55:18,729 INFO L628 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-09 05:55:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-09 05:55:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-09 05:55:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-09 05:55:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2019-09-09 05:55:18,733 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 127 [2019-09-09 05:55:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,733 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2019-09-09 05:55:18,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2019-09-09 05:55:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:55:18,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,735 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:55:18,735 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1514463008, now seen corresponding path program 1 times [2019-09-09 05:55:18,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,796 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand 4 states. [2019-09-09 05:55:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,057 INFO L93 Difference]: Finished difference Result 375 states and 563 transitions. [2019-09-09 05:55:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:55:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,060 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:55:19,060 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:55:19,061 INFO L628 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-09 05:55:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:55:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2019-09-09 05:55:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-09 05:55:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-09 05:55:19,079 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 128 [2019-09-09 05:55:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,079 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-09 05:55:19,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-09 05:55:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:55:19,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,083 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:19,083 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1739032258, now seen corresponding path program 1 times [2019-09-09 05:55:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,182 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-09 05:55:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,664 INFO L93 Difference]: Finished difference Result 465 states and 705 transitions. [2019-09-09 05:55:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:55:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,666 INFO L225 Difference]: With dead ends: 465 [2019-09-09 05:55:19,666 INFO L226 Difference]: Without dead ends: 465 [2019-09-09 05:55:19,667 INFO L628 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-09 05:55:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-09 05:55:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2019-09-09 05:55:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-09 05:55:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 613 transitions. [2019-09-09 05:55:19,673 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 613 transitions. Word has length 129 [2019-09-09 05:55:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,673 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 613 transitions. [2019-09-09 05:55:19,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2019-09-09 05:55:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:55:19,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,675 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:19,675 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash -26388266, now seen corresponding path program 1 times [2019-09-09 05:55:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:19,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,744 INFO L87 Difference]: Start difference. First operand 398 states and 613 transitions. Second operand 4 states. [2019-09-09 05:55:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,149 INFO L93 Difference]: Finished difference Result 457 states and 693 transitions. [2019-09-09 05:55:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-09 05:55:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,153 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:55:20,153 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:55:20,153 INFO L628 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-09 05:55:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:55:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 359. [2019-09-09 05:55:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-09 05:55:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-09 05:55:20,157 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 130 [2019-09-09 05:55:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,158 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-09 05:55:20,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-09 05:55:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-09 05:55:20,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,159 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:20,159 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 889689834, now seen corresponding path program 1 times [2019-09-09 05:55:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,229 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-09 05:55:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,552 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2019-09-09 05:55:20,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-09 05:55:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,555 INFO L225 Difference]: With dead ends: 374 [2019-09-09 05:55:20,555 INFO L226 Difference]: Without dead ends: 374 [2019-09-09 05:55:20,555 INFO L628 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-09 05:55:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-09 05:55:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2019-09-09 05:55:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:55:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 545 transitions. [2019-09-09 05:55:20,559 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 545 transitions. Word has length 131 [2019-09-09 05:55:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,559 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 545 transitions. [2019-09-09 05:55:20,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 545 transitions. [2019-09-09 05:55:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:20,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,560 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:20,561 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1967666446, now seen corresponding path program 1 times [2019-09-09 05:55:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:20,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,630 INFO L87 Difference]: Start difference. First operand 362 states and 545 transitions. Second operand 4 states. [2019-09-09 05:55:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,900 INFO L93 Difference]: Finished difference Result 378 states and 565 transitions. [2019-09-09 05:55:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,903 INFO L225 Difference]: With dead ends: 378 [2019-09-09 05:55:20,903 INFO L226 Difference]: Without dead ends: 378 [2019-09-09 05:55:20,903 INFO L628 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-09 05:55:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-09 05:55:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 362. [2019-09-09 05:55:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:55:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2019-09-09 05:55:20,908 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 138 [2019-09-09 05:55:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,908 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2019-09-09 05:55:20,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-09-09 05:55:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:20,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,909 INFO L399 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] [2019-09-09 05:55:20,909 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1007233089, now seen corresponding path program 1 times [2019-09-09 05:55:20,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,990 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-09 05:55:20,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,991 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand 4 states. [2019-09-09 05:55:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,333 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-09-09 05:55:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,337 INFO L225 Difference]: With dead ends: 424 [2019-09-09 05:55:21,337 INFO L226 Difference]: Without dead ends: 424 [2019-09-09 05:55:21,337 INFO L628 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-09 05:55:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-09 05:55:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 390. [2019-09-09 05:55:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-09 05:55:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 593 transitions. [2019-09-09 05:55:21,342 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 593 transitions. Word has length 138 [2019-09-09 05:55:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,342 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 593 transitions. [2019-09-09 05:55:21,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 593 transitions. [2019-09-09 05:55:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:55:21,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,343 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:21,343 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash -469096928, now seen corresponding path program 1 times [2019-09-09 05:55:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,410 INFO L87 Difference]: Start difference. First operand 390 states and 593 transitions. Second operand 4 states. [2019-09-09 05:55:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,801 INFO L93 Difference]: Finished difference Result 488 states and 743 transitions. [2019-09-09 05:55:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:55:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,804 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:21,804 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:21,804 INFO L628 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-09 05:55:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 402. [2019-09-09 05:55:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-09 05:55:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 610 transitions. [2019-09-09 05:55:21,809 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 610 transitions. Word has length 139 [2019-09-09 05:55:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,810 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 610 transitions. [2019-09-09 05:55:21,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 610 transitions. [2019-09-09 05:55:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:55:21,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,811 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:55:21,811 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash 686289537, now seen corresponding path program 1 times [2019-09-09 05:55:21,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,875 INFO L87 Difference]: Start difference. First operand 402 states and 610 transitions. Second operand 4 states. [2019-09-09 05:55:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,136 INFO L93 Difference]: Finished difference Result 416 states and 628 transitions. [2019-09-09 05:55:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:55:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,140 INFO L225 Difference]: With dead ends: 416 [2019-09-09 05:55:22,140 INFO L226 Difference]: Without dead ends: 416 [2019-09-09 05:55:22,140 INFO L628 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-09 05:55:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-09 05:55:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 402. [2019-09-09 05:55:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-09 05:55:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 609 transitions. [2019-09-09 05:55:22,145 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 609 transitions. Word has length 139 [2019-09-09 05:55:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,146 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 609 transitions. [2019-09-09 05:55:22,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 609 transitions. [2019-09-09 05:55:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:55:22,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,147 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:22,148 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1630340761, now seen corresponding path program 1 times [2019-09-09 05:55:22,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:22,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,213 INFO L87 Difference]: Start difference. First operand 402 states and 609 transitions. Second operand 4 states. [2019-09-09 05:55:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,594 INFO L93 Difference]: Finished difference Result 488 states and 741 transitions. [2019-09-09 05:55:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:55:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,597 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:22,597 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:22,597 INFO L628 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-09 05:55:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 403. [2019-09-09 05:55:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-09 05:55:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 610 transitions. [2019-09-09 05:55:22,602 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 610 transitions. Word has length 140 [2019-09-09 05:55:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,602 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 610 transitions. [2019-09-09 05:55:22,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 610 transitions. [2019-09-09 05:55:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:55:22,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,603 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:22,603 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1453629797, now seen corresponding path program 1 times [2019-09-09 05:55:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:22,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,667 INFO L87 Difference]: Start difference. First operand 403 states and 610 transitions. Second operand 4 states. [2019-09-09 05:55:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,052 INFO L93 Difference]: Finished difference Result 488 states and 740 transitions. [2019-09-09 05:55:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:55:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,054 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:23,054 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:23,055 INFO L628 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-09 05:55:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 404. [2019-09-09 05:55:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-09 05:55:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 611 transitions. [2019-09-09 05:55:23,059 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 611 transitions. Word has length 141 [2019-09-09 05:55:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,059 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 611 transitions. [2019-09-09 05:55:23,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 611 transitions. [2019-09-09 05:55:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:55:23,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,060 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:23,061 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2014498764, now seen corresponding path program 1 times [2019-09-09 05:55:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:23,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,118 INFO L87 Difference]: Start difference. First operand 404 states and 611 transitions. Second operand 4 states. [2019-09-09 05:55:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,481 INFO L93 Difference]: Finished difference Result 478 states and 727 transitions. [2019-09-09 05:55:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:55:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,483 INFO L225 Difference]: With dead ends: 478 [2019-09-09 05:55:23,483 INFO L226 Difference]: Without dead ends: 478 [2019-09-09 05:55:23,484 INFO L628 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-09 05:55:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-09 05:55:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 405. [2019-09-09 05:55:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-09 05:55:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2019-09-09 05:55:23,489 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 142 [2019-09-09 05:55:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,489 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2019-09-09 05:55:23,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2019-09-09 05:55:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:55:23,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,490 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,490 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -159483381, now seen corresponding path program 1 times [2019-09-09 05:55:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:23,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,556 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 4 states. [2019-09-09 05:55:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,973 INFO L93 Difference]: Finished difference Result 488 states and 738 transitions. [2019-09-09 05:55:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:55:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,976 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:23,976 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:23,976 INFO L628 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-09 05:55:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-09 05:55:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-09 05:55:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2019-09-09 05:55:23,982 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 144 [2019-09-09 05:55:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,982 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2019-09-09 05:55:23,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2019-09-09 05:55:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:55:23,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,984 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,984 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1656541170, now seen corresponding path program 1 times [2019-09-09 05:55:23,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,049 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 4 states. [2019-09-09 05:55:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,458 INFO L93 Difference]: Finished difference Result 488 states and 737 transitions. [2019-09-09 05:55:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:55:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,462 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:24,462 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:24,462 INFO L628 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-09 05:55:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-09 05:55:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-09 05:55:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2019-09-09 05:55:24,466 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 145 [2019-09-09 05:55:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,466 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2019-09-09 05:55:24,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2019-09-09 05:55:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-09 05:55:24,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,469 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,469 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -267754554, now seen corresponding path program 1 times [2019-09-09 05:55:24,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:24,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,521 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 4 states. [2019-09-09 05:55:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,925 INFO L93 Difference]: Finished difference Result 488 states and 736 transitions. [2019-09-09 05:55:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-09 05:55:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,928 INFO L225 Difference]: With dead ends: 488 [2019-09-09 05:55:24,928 INFO L226 Difference]: Without dead ends: 488 [2019-09-09 05:55:24,929 INFO L628 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-09 05:55:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-09 05:55:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-09 05:55:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-09 05:55:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2019-09-09 05:55:24,933 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 146 [2019-09-09 05:55:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,933 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2019-09-09 05:55:24,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2019-09-09 05:55:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-09 05:55:24,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,934 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,935 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash 387895401, now seen corresponding path program 1 times [2019-09-09 05:55:24,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:24,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,000 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 4 states. [2019-09-09 05:55:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,417 INFO L93 Difference]: Finished difference Result 478 states and 723 transitions. [2019-09-09 05:55:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-09 05:55:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,419 INFO L225 Difference]: With dead ends: 478 [2019-09-09 05:55:25,419 INFO L226 Difference]: Without dead ends: 478 [2019-09-09 05:55:25,420 INFO L628 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-09 05:55:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-09 05:55:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2019-09-09 05:55:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-09 05:55:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 588 transitions. [2019-09-09 05:55:25,435 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 588 transitions. Word has length 147 [2019-09-09 05:55:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,436 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 588 transitions. [2019-09-09 05:55:25,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 588 transitions. [2019-09-09 05:55:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:55:25,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,437 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:25,437 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 271831238, now seen corresponding path program 1 times [2019-09-09 05:55:25,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:25,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,502 INFO L87 Difference]: Start difference. First operand 390 states and 588 transitions. Second operand 4 states. [2019-09-09 05:55:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,853 INFO L93 Difference]: Finished difference Result 478 states and 722 transitions. [2019-09-09 05:55:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:55:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,855 INFO L225 Difference]: With dead ends: 478 [2019-09-09 05:55:25,855 INFO L226 Difference]: Without dead ends: 478 [2019-09-09 05:55:25,856 INFO L628 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-09 05:55:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-09 05:55:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 418. [2019-09-09 05:55:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-09 05:55:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-09-09 05:55:25,860 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 149 [2019-09-09 05:55:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,860 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-09-09 05:55:25,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-09-09 05:55:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:55:25,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,861 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2019-09-09 05:55:25,861 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash -935122689, now seen corresponding path program 1 times [2019-09-09 05:55:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:25,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,934 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,267 INFO L93 Difference]: Finished difference Result 470 states and 708 transitions. [2019-09-09 05:55:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:55:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,270 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:55:26,270 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:55:26,270 INFO L628 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-09 05:55:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:55:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2019-09-09 05:55:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-09 05:55:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-09 05:55:26,275 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 150 [2019-09-09 05:55:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,276 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-09 05:55:26,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-09 05:55:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:55:26,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,277 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2019-09-09 05:55:26,277 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 401457478, now seen corresponding path program 1 times [2019-09-09 05:55:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,331 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,730 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-09-09 05:55:26,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:55:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,734 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:55:26,734 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:55:26,734 INFO L628 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-09 05:55:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:55:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2019-09-09 05:55:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-09 05:55:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 633 transitions. [2019-09-09 05:55:26,739 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 633 transitions. Word has length 152 [2019-09-09 05:55:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,739 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 633 transitions. [2019-09-09 05:55:26,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 633 transitions. [2019-09-09 05:55:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:26,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,740 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:26,740 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash -748874306, now seen corresponding path program 1 times [2019-09-09 05:55:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,812 INFO L87 Difference]: Start difference. First operand 419 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,145 INFO L93 Difference]: Finished difference Result 467 states and 702 transitions. [2019-09-09 05:55:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,147 INFO L225 Difference]: With dead ends: 467 [2019-09-09 05:55:27,147 INFO L226 Difference]: Without dead ends: 467 [2019-09-09 05:55:27,148 INFO L628 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-09 05:55:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-09 05:55:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 422. [2019-09-09 05:55:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 638 transitions. [2019-09-09 05:55:27,153 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 638 transitions. Word has length 153 [2019-09-09 05:55:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 638 transitions. [2019-09-09 05:55:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 638 transitions. [2019-09-09 05:55:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:27,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,154 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2019-09-09 05:55:27,155 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1114687149, now seen corresponding path program 1 times [2019-09-09 05:55:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:27,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,211 INFO L87 Difference]: Start difference. First operand 422 states and 638 transitions. Second operand 4 states. [2019-09-09 05:55:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,540 INFO L93 Difference]: Finished difference Result 465 states and 699 transitions. [2019-09-09 05:55:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,543 INFO L225 Difference]: With dead ends: 465 [2019-09-09 05:55:27,543 INFO L226 Difference]: Without dead ends: 465 [2019-09-09 05:55:27,543 INFO L628 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-09 05:55:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-09 05:55:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 422. [2019-09-09 05:55:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2019-09-09 05:55:27,553 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 153 [2019-09-09 05:55:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,554 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2019-09-09 05:55:27,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2019-09-09 05:55:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:27,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,555 INFO L399 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] [2019-09-09 05:55:27,555 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,556 INFO L82 PathProgramCache]: Analyzing trace with hash -667974488, now seen corresponding path program 1 times [2019-09-09 05:55:27,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,621 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-09 05:55:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,622 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2019-09-09 05:55:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,958 INFO L93 Difference]: Finished difference Result 456 states and 682 transitions. [2019-09-09 05:55:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,962 INFO L225 Difference]: With dead ends: 456 [2019-09-09 05:55:27,962 INFO L226 Difference]: Without dead ends: 456 [2019-09-09 05:55:27,963 INFO L628 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-09 05:55:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-09 05:55:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2019-09-09 05:55:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2019-09-09 05:55:27,968 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 153 [2019-09-09 05:55:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,969 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2019-09-09 05:55:27,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2019-09-09 05:55:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:27,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,970 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:55:27,970 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1972140785, now seen corresponding path program 1 times [2019-09-09 05:55:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,037 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 4 states. [2019-09-09 05:55:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,426 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2019-09-09 05:55:28,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,429 INFO L225 Difference]: With dead ends: 478 [2019-09-09 05:55:28,429 INFO L226 Difference]: Without dead ends: 478 [2019-09-09 05:55:28,429 INFO L628 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-09 05:55:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-09 05:55:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2019-09-09 05:55:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 635 transitions. [2019-09-09 05:55:28,439 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 635 transitions. Word has length 154 [2019-09-09 05:55:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,440 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 635 transitions. [2019-09-09 05:55:28,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 635 transitions. [2019-09-09 05:55:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:28,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,441 INFO L399 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] [2019-09-09 05:55:28,441 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash -239896303, now seen corresponding path program 1 times [2019-09-09 05:55:28,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,495 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-09 05:55:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,496 INFO L87 Difference]: Start difference. First operand 422 states and 635 transitions. Second operand 4 states. [2019-09-09 05:55:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,841 INFO L93 Difference]: Finished difference Result 456 states and 680 transitions. [2019-09-09 05:55:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,843 INFO L225 Difference]: With dead ends: 456 [2019-09-09 05:55:28,843 INFO L226 Difference]: Without dead ends: 456 [2019-09-09 05:55:28,843 INFO L628 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-09 05:55:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-09 05:55:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2019-09-09 05:55:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 634 transitions. [2019-09-09 05:55:28,849 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 634 transitions. Word has length 154 [2019-09-09 05:55:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,849 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 634 transitions. [2019-09-09 05:55:28,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 634 transitions. [2019-09-09 05:55:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:28,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,851 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:28,851 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash 234865716, now seen corresponding path program 1 times [2019-09-09 05:55:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:28,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,903 INFO L87 Difference]: Start difference. First operand 422 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,264 INFO L93 Difference]: Finished difference Result 470 states and 701 transitions. [2019-09-09 05:55:29,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,266 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:55:29,266 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:55:29,267 INFO L628 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-09 05:55:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:55:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 422. [2019-09-09 05:55:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-09 05:55:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 633 transitions. [2019-09-09 05:55:29,272 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 633 transitions. Word has length 155 [2019-09-09 05:55:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,272 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 633 transitions. [2019-09-09 05:55:29,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 633 transitions. [2019-09-09 05:55:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:29,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,273 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:29,273 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1740450912, now seen corresponding path program 1 times [2019-09-09 05:55:29,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,323 INFO L87 Difference]: Start difference. First operand 422 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,652 INFO L93 Difference]: Finished difference Result 465 states and 694 transitions. [2019-09-09 05:55:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,654 INFO L225 Difference]: With dead ends: 465 [2019-09-09 05:55:29,654 INFO L226 Difference]: Without dead ends: 465 [2019-09-09 05:55:29,654 INFO L628 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-09 05:55:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-09 05:55:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 423. [2019-09-09 05:55:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-09 05:55:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 634 transitions. [2019-09-09 05:55:29,658 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 634 transitions. Word has length 155 [2019-09-09 05:55:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,658 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 634 transitions. [2019-09-09 05:55:29,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 634 transitions. [2019-09-09 05:55:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:29,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,659 INFO L399 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] [2019-09-09 05:55:29,660 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash 698563363, now seen corresponding path program 1 times [2019-09-09 05:55:29,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,716 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-09 05:55:29,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,718 INFO L87 Difference]: Start difference. First operand 423 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,073 INFO L93 Difference]: Finished difference Result 457 states and 679 transitions. [2019-09-09 05:55:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,075 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:55:30,075 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:55:30,075 INFO L628 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-09 05:55:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:55:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2019-09-09 05:55:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-09 05:55:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 633 transitions. [2019-09-09 05:55:30,080 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 633 transitions. Word has length 155 [2019-09-09 05:55:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,080 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 633 transitions. [2019-09-09 05:55:30,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 633 transitions. [2019-09-09 05:55:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:30,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,081 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:30,082 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1125171618, now seen corresponding path program 1 times [2019-09-09 05:55:30,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:30,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,149 INFO L87 Difference]: Start difference. First operand 423 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,464 INFO L93 Difference]: Finished difference Result 461 states and 687 transitions. [2019-09-09 05:55:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,466 INFO L225 Difference]: With dead ends: 461 [2019-09-09 05:55:30,466 INFO L226 Difference]: Without dead ends: 461 [2019-09-09 05:55:30,466 INFO L628 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-09 05:55:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-09 05:55:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 424. [2019-09-09 05:55:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-09 05:55:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 634 transitions. [2019-09-09 05:55:30,472 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 634 transitions. Word has length 156 [2019-09-09 05:55:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,473 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 634 transitions. [2019-09-09 05:55:30,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 634 transitions. [2019-09-09 05:55:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:30,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,474 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:55:30,474 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash -479739409, now seen corresponding path program 1 times [2019-09-09 05:55:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,528 INFO L87 Difference]: Start difference. First operand 424 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,854 INFO L93 Difference]: Finished difference Result 461 states and 686 transitions. [2019-09-09 05:55:30,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,856 INFO L225 Difference]: With dead ends: 461 [2019-09-09 05:55:30,856 INFO L226 Difference]: Without dead ends: 461 [2019-09-09 05:55:30,857 INFO L628 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-09 05:55:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-09 05:55:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2019-09-09 05:55:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-09 05:55:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 635 transitions. [2019-09-09 05:55:30,863 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 635 transitions. Word has length 156 [2019-09-09 05:55:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,863 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 635 transitions. [2019-09-09 05:55:30,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 635 transitions. [2019-09-09 05:55:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:30,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,864 INFO L399 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] [2019-09-09 05:55:30,864 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash 278979756, now seen corresponding path program 1 times [2019-09-09 05:55:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,910 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-09 05:55:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,912 INFO L87 Difference]: Start difference. First operand 425 states and 635 transitions. Second operand 4 states. [2019-09-09 05:55:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,222 INFO L93 Difference]: Finished difference Result 449 states and 668 transitions. [2019-09-09 05:55:31,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,224 INFO L225 Difference]: With dead ends: 449 [2019-09-09 05:55:31,224 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:55:31,224 INFO L628 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-09 05:55:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:55:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2019-09-09 05:55:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-09 05:55:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 634 transitions. [2019-09-09 05:55:31,230 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 634 transitions. Word has length 156 [2019-09-09 05:55:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,230 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 634 transitions. [2019-09-09 05:55:31,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 634 transitions. [2019-09-09 05:55:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:31,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,232 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,232 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash -521116869, now seen corresponding path program 1 times [2019-09-09 05:55:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:31,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,285 INFO L87 Difference]: Start difference. First operand 425 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,643 INFO L93 Difference]: Finished difference Result 470 states and 695 transitions. [2019-09-09 05:55:31,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,645 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:55:31,645 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:55:31,646 INFO L628 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-09 05:55:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:55:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 425. [2019-09-09 05:55:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-09 05:55:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 633 transitions. [2019-09-09 05:55:31,651 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 633 transitions. Word has length 157 [2019-09-09 05:55:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,651 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 633 transitions. [2019-09-09 05:55:31,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 633 transitions. [2019-09-09 05:55:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:31,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,653 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:55:31,653 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash -742841583, now seen corresponding path program 1 times [2019-09-09 05:55:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:31,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,709 INFO L87 Difference]: Start difference. First operand 425 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,034 INFO L93 Difference]: Finished difference Result 459 states and 681 transitions. [2019-09-09 05:55:32,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,036 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:55:32,036 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:55:32,036 INFO L628 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-09 05:55:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:55:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 426. [2019-09-09 05:55:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-09 05:55:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 634 transitions. [2019-09-09 05:55:32,041 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 634 transitions. Word has length 157 [2019-09-09 05:55:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,042 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 634 transitions. [2019-09-09 05:55:32,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 634 transitions. [2019-09-09 05:55:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:32,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,043 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:32,043 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash 716092009, now seen corresponding path program 1 times [2019-09-09 05:55:32,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:32,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,147 INFO L87 Difference]: Start difference. First operand 426 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,470 INFO L93 Difference]: Finished difference Result 467 states and 689 transitions. [2019-09-09 05:55:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,472 INFO L225 Difference]: With dead ends: 467 [2019-09-09 05:55:32,472 INFO L226 Difference]: Without dead ends: 467 [2019-09-09 05:55:32,474 INFO L628 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-09 05:55:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-09 05:55:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 426. [2019-09-09 05:55:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-09 05:55:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2019-09-09 05:55:32,487 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 158 [2019-09-09 05:55:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,487 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2019-09-09 05:55:32,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2019-09-09 05:55:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:32,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,488 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,489 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1715313832, now seen corresponding path program 1 times [2019-09-09 05:55:32,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:32,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,556 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,886 INFO L93 Difference]: Finished difference Result 465 states and 686 transitions. [2019-09-09 05:55:32,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,888 INFO L225 Difference]: With dead ends: 465 [2019-09-09 05:55:32,888 INFO L226 Difference]: Without dead ends: 465 [2019-09-09 05:55:32,889 INFO L628 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-09 05:55:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-09 05:55:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2019-09-09 05:55:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-09 05:55:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 632 transitions. [2019-09-09 05:55:32,894 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 632 transitions. Word has length 158 [2019-09-09 05:55:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,894 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 632 transitions. [2019-09-09 05:55:32,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 632 transitions. [2019-09-09 05:55:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:32,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,896 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:55:32,896 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1287697130, now seen corresponding path program 1 times [2019-09-09 05:55:32,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:32,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,973 INFO L87 Difference]: Start difference. First operand 426 states and 632 transitions. Second operand 4 states. [2019-09-09 05:55:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,292 INFO L93 Difference]: Finished difference Result 459 states and 678 transitions. [2019-09-09 05:55:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:33,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,294 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:55:33,294 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:55:33,294 INFO L628 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-09 05:55:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:55:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 427. [2019-09-09 05:55:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-09 05:55:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 633 transitions. [2019-09-09 05:55:33,300 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 633 transitions. Word has length 158 [2019-09-09 05:55:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,300 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 633 transitions. [2019-09-09 05:55:33,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2019-09-09 05:55:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:33,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,302 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:33,302 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 226461420, now seen corresponding path program 1 times [2019-09-09 05:55:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:33,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,380 INFO L87 Difference]: Start difference. First operand 427 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,685 INFO L93 Difference]: Finished difference Result 457 states and 675 transitions. [2019-09-09 05:55:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:33,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,687 INFO L225 Difference]: With dead ends: 457 [2019-09-09 05:55:33,687 INFO L226 Difference]: Without dead ends: 457 [2019-09-09 05:55:33,687 INFO L628 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-09 05:55:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-09 05:55:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 428. [2019-09-09 05:55:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2019-09-09 05:55:33,692 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 159 [2019-09-09 05:55:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,692 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2019-09-09 05:55:33,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2019-09-09 05:55:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:55:33,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,693 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-09 05:55:33,693 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash 823806539, now seen corresponding path program 1 times [2019-09-09 05:55:33,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:33,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,765 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand 4 states. [2019-09-09 05:55:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,113 INFO L93 Difference]: Finished difference Result 465 states and 683 transitions. [2019-09-09 05:55:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:55:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,114 INFO L225 Difference]: With dead ends: 465 [2019-09-09 05:55:34,115 INFO L226 Difference]: Without dead ends: 465 [2019-09-09 05:55:34,115 INFO L628 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-09 05:55:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-09 05:55:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 428. [2019-09-09 05:55:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2019-09-09 05:55:34,120 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 160 [2019-09-09 05:55:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,120 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2019-09-09 05:55:34,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2019-09-09 05:55:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:55:34,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,122 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:34,122 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 523623891, now seen corresponding path program 1 times [2019-09-09 05:55:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:34,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:34,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:34,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:34,200 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2019-09-09 05:55:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,545 INFO L93 Difference]: Finished difference Result 461 states and 677 transitions. [2019-09-09 05:55:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:55:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,547 INFO L225 Difference]: With dead ends: 461 [2019-09-09 05:55:34,548 INFO L226 Difference]: Without dead ends: 461 [2019-09-09 05:55:34,548 INFO L628 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-09 05:55:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-09 05:55:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2019-09-09 05:55:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 632 transitions. [2019-09-09 05:55:34,554 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 632 transitions. Word has length 161 [2019-09-09 05:55:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,554 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 632 transitions. [2019-09-09 05:55:34,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 632 transitions. [2019-09-09 05:55:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:55:34,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,556 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:34,556 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1169056100, now seen corresponding path program 1 times [2019-09-09 05:55:34,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:34,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:34,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:34,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:34,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:34,634 INFO L87 Difference]: Start difference. First operand 428 states and 632 transitions. Second operand 4 states. [2019-09-09 05:55:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,949 INFO L93 Difference]: Finished difference Result 461 states and 676 transitions. [2019-09-09 05:55:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:55:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,951 INFO L225 Difference]: With dead ends: 461 [2019-09-09 05:55:34,951 INFO L226 Difference]: Without dead ends: 461 [2019-09-09 05:55:34,951 INFO L628 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-09 05:55:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-09 05:55:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2019-09-09 05:55:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2019-09-09 05:55:34,956 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 161 [2019-09-09 05:55:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,956 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2019-09-09 05:55:34,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2019-09-09 05:55:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:55:34,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,957 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:34,957 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1169788356, now seen corresponding path program 1 times [2019-09-09 05:55:34,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:35,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,011 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2019-09-09 05:55:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,333 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-09-09 05:55:35,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:35,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:55:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,335 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:55:35,335 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:55:35,336 INFO L628 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-09 05:55:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:55:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2019-09-09 05:55:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 630 transitions. [2019-09-09 05:55:35,340 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 630 transitions. Word has length 162 [2019-09-09 05:55:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,340 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 630 transitions. [2019-09-09 05:55:35,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 630 transitions. [2019-09-09 05:55:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:35,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:35,342 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:35,342 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:35,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash 937249055, now seen corresponding path program 1 times [2019-09-09 05:55:35,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:35,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:35,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:35,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,426 INFO L87 Difference]: Start difference. First operand 428 states and 630 transitions. Second operand 4 states. [2019-09-09 05:55:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,748 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2019-09-09 05:55:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:35,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,750 INFO L225 Difference]: With dead ends: 459 [2019-09-09 05:55:35,750 INFO L226 Difference]: Without dead ends: 459 [2019-09-09 05:55:35,751 INFO L628 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-09 05:55:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-09 05:55:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2019-09-09 05:55:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-09 05:55:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2019-09-09 05:55:35,756 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 163 [2019-09-09 05:55:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,756 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2019-09-09 05:55:35,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2019-09-09 05:55:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:35,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:35,758 INFO L399 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] [2019-09-09 05:55:35,758 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -314923698, now seen corresponding path program 1 times [2019-09-09 05:55:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,848 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-09 05:55:35,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,850 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2019-09-09 05:55:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:36,263 INFO L93 Difference]: Finished difference Result 494 states and 730 transitions. [2019-09-09 05:55:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:36,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:36,265 INFO L225 Difference]: With dead ends: 494 [2019-09-09 05:55:36,265 INFO L226 Difference]: Without dead ends: 494 [2019-09-09 05:55:36,266 INFO L628 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-09 05:55:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-09 05:55:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 458. [2019-09-09 05:55:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-09 05:55:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2019-09-09 05:55:36,271 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 163 [2019-09-09 05:55:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:36,271 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2019-09-09 05:55:36,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2019-09-09 05:55:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:55:36,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:36,272 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:55:36,273 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2047494313, now seen corresponding path program 1 times [2019-09-09 05:55:36,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:36,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:36,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:36,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:36,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:36,326 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand 4 states. [2019-09-09 05:55:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:36,648 INFO L93 Difference]: Finished difference Result 487 states and 722 transitions. [2019-09-09 05:55:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:36,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:55:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:36,650 INFO L225 Difference]: With dead ends: 487 [2019-09-09 05:55:36,650 INFO L226 Difference]: Without dead ends: 487 [2019-09-09 05:55:36,650 INFO L628 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-09 05:55:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-09 05:55:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 420. [2019-09-09 05:55:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-09 05:55:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2019-09-09 05:55:36,655 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 164 [2019-09-09 05:55:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:36,656 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2019-09-09 05:55:36,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2019-09-09 05:55:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:36,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:36,657 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:36,657 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:36,657 INFO L82 PathProgramCache]: Analyzing trace with hash -990417559, now seen corresponding path program 1 times [2019-09-09 05:55:36,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:36,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:36,758 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2019-09-09 05:55:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:37,080 INFO L93 Difference]: Finished difference Result 487 states and 721 transitions. [2019-09-09 05:55:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:37,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:37,083 INFO L225 Difference]: With dead ends: 487 [2019-09-09 05:55:37,083 INFO L226 Difference]: Without dead ends: 487 [2019-09-09 05:55:37,083 INFO L628 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-09 05:55:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-09 05:55:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 450. [2019-09-09 05:55:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:55:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 671 transitions. [2019-09-09 05:55:37,089 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 671 transitions. Word has length 166 [2019-09-09 05:55:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:37,090 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 671 transitions. [2019-09-09 05:55:37,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 671 transitions. [2019-09-09 05:55:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:37,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:37,091 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:37,092 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 902053822, now seen corresponding path program 1 times [2019-09-09 05:55:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:37,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:37,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:37,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:37,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:37,170 INFO L87 Difference]: Start difference. First operand 450 states and 671 transitions. Second operand 4 states. [2019-09-09 05:55:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:37,539 INFO L93 Difference]: Finished difference Result 489 states and 722 transitions. [2019-09-09 05:55:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:37,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:37,541 INFO L225 Difference]: With dead ends: 489 [2019-09-09 05:55:37,541 INFO L226 Difference]: Without dead ends: 489 [2019-09-09 05:55:37,541 INFO L628 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-09 05:55:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-09 05:55:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2019-09-09 05:55:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:55:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2019-09-09 05:55:37,545 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 166 [2019-09-09 05:55:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:37,545 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2019-09-09 05:55:37,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2019-09-09 05:55:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:37,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:37,547 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:55:37,547 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1917776931, now seen corresponding path program 1 times [2019-09-09 05:55:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:55:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:37,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:37,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:37,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:37,592 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand 4 states. [2019-09-09 05:55:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:37,851 INFO L93 Difference]: Finished difference Result 463 states and 687 transitions. [2019-09-09 05:55:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:37,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:37,853 INFO L225 Difference]: With dead ends: 463 [2019-09-09 05:55:37,853 INFO L226 Difference]: Without dead ends: 463 [2019-09-09 05:55:37,853 INFO L628 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-09 05:55:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-09 05:55:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2019-09-09 05:55:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:55:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2019-09-09 05:55:37,859 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 167 [2019-09-09 05:55:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:37,859 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2019-09-09 05:55:37,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2019-09-09 05:55:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:37,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:37,860 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:37,861 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1186341051, now seen corresponding path program 1 times [2019-09-09 05:55:37,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:37,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:37,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:37,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:37,927 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand 4 states. [2019-09-09 05:55:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:38,275 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-09-09 05:55:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:38,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:38,278 INFO L225 Difference]: With dead ends: 489 [2019-09-09 05:55:38,278 INFO L226 Difference]: Without dead ends: 489 [2019-09-09 05:55:38,279 INFO L628 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-09 05:55:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-09 05:55:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2019-09-09 05:55:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:55:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 668 transitions. [2019-09-09 05:55:38,284 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 668 transitions. Word has length 167 [2019-09-09 05:55:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:38,284 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 668 transitions. [2019-09-09 05:55:38,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 668 transitions. [2019-09-09 05:55:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:55:38,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:38,286 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:38,286 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1962248377, now seen corresponding path program 1 times [2019-09-09 05:55:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:38,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:38,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:38,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:38,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:38,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:38,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:38,364 INFO L87 Difference]: Start difference. First operand 450 states and 668 transitions. Second operand 4 states. [2019-09-09 05:55:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:38,652 INFO L93 Difference]: Finished difference Result 474 states and 701 transitions. [2019-09-09 05:55:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:38,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 05:55:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:38,653 INFO L225 Difference]: With dead ends: 474 [2019-09-09 05:55:38,654 INFO L226 Difference]: Without dead ends: 474 [2019-09-09 05:55:38,654 INFO L628 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-09 05:55:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-09 05:55:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 450. [2019-09-09 05:55:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:55:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 667 transitions. [2019-09-09 05:55:38,659 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 667 transitions. Word has length 168 [2019-09-09 05:55:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:38,659 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 667 transitions. [2019-09-09 05:55:38,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 667 transitions. [2019-09-09 05:55:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:55:38,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:38,663 INFO L399 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-09 05:55:38,663 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1064728021, now seen corresponding path program 1 times [2019-09-09 05:55:38,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:38,802 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-09 05:55:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:38,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:38,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:38,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:38,803 INFO L87 Difference]: Start difference. First operand 450 states and 667 transitions. Second operand 5 states. [2019-09-09 05:55:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:39,387 INFO L93 Difference]: Finished difference Result 526 states and 783 transitions. [2019-09-09 05:55:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:55:39,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-09 05:55:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:39,389 INFO L225 Difference]: With dead ends: 526 [2019-09-09 05:55:39,389 INFO L226 Difference]: Without dead ends: 526 [2019-09-09 05:55:39,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:55:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-09 05:55:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 483. [2019-09-09 05:55:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-09 05:55:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 726 transitions. [2019-09-09 05:55:39,393 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 726 transitions. Word has length 168 [2019-09-09 05:55:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:39,394 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 726 transitions. [2019-09-09 05:55:39,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 726 transitions. [2019-09-09 05:55:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:39,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:39,394 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:39,395 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1283677808, now seen corresponding path program 1 times [2019-09-09 05:55:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:39,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:39,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:39,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:39,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:39,472 INFO L87 Difference]: Start difference. First operand 483 states and 726 transitions. Second operand 4 states. [2019-09-09 05:55:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:39,772 INFO L93 Difference]: Finished difference Result 505 states and 757 transitions. [2019-09-09 05:55:39,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:39,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:55:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:39,775 INFO L225 Difference]: With dead ends: 505 [2019-09-09 05:55:39,775 INFO L226 Difference]: Without dead ends: 505 [2019-09-09 05:55:39,775 INFO L628 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-09 05:55:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-09 05:55:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2019-09-09 05:55:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-09 05:55:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 725 transitions. [2019-09-09 05:55:39,782 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 725 transitions. Word has length 169 [2019-09-09 05:55:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:39,782 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 725 transitions. [2019-09-09 05:55:39,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 725 transitions. [2019-09-09 05:55:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:55:39,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:39,784 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:39,784 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:39,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash -40787640, now seen corresponding path program 1 times [2019-09-09 05:55:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-09 05:55:39,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:39,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:39,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:39,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:39,857 INFO L87 Difference]: Start difference. First operand 483 states and 725 transitions. Second operand 3 states. [2019-09-09 05:55:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:39,923 INFO L93 Difference]: Finished difference Result 933 states and 1401 transitions. [2019-09-09 05:55:39,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:39,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:55:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:39,925 INFO L225 Difference]: With dead ends: 933 [2019-09-09 05:55:39,925 INFO L226 Difference]: Without dead ends: 933 [2019-09-09 05:55:39,925 INFO L628 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-09 05:55:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-09 05:55:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2019-09-09 05:55:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-09 05:55:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1401 transitions. [2019-09-09 05:55:39,949 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1401 transitions. Word has length 172 [2019-09-09 05:55:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:39,949 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1401 transitions. [2019-09-09 05:55:39,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1401 transitions. [2019-09-09 05:55:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:55:39,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:39,951 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:39,951 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1874456679, now seen corresponding path program 1 times [2019-09-09 05:55:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:55:40,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:40,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:40,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:40,058 INFO L87 Difference]: Start difference. First operand 933 states and 1401 transitions. Second operand 4 states. [2019-09-09 05:55:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:40,375 INFO L93 Difference]: Finished difference Result 1007 states and 1493 transitions. [2019-09-09 05:55:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:40,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-09 05:55:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:40,377 INFO L225 Difference]: With dead ends: 1007 [2019-09-09 05:55:40,378 INFO L226 Difference]: Without dead ends: 1007 [2019-09-09 05:55:40,378 INFO L628 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-09 05:55:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-09 05:55:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 873. [2019-09-09 05:55:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-09 05:55:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1309 transitions. [2019-09-09 05:55:40,390 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1309 transitions. Word has length 173 [2019-09-09 05:55:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:40,390 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1309 transitions. [2019-09-09 05:55:40,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1309 transitions. [2019-09-09 05:55:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:55:40,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:40,392 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:40,392 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1008288102, now seen corresponding path program 1 times [2019-09-09 05:55:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:40,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:40,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:40,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:40,464 INFO L87 Difference]: Start difference. First operand 873 states and 1309 transitions. Second operand 3 states. [2019-09-09 05:55:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:40,518 INFO L93 Difference]: Finished difference Result 1291 states and 1935 transitions. [2019-09-09 05:55:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:40,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-09 05:55:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:40,520 INFO L225 Difference]: With dead ends: 1291 [2019-09-09 05:55:40,520 INFO L226 Difference]: Without dead ends: 1291 [2019-09-09 05:55:40,520 INFO L628 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-09 05:55:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-09-09 05:55:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2019-09-09 05:55:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-09-09 05:55:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1934 transitions. [2019-09-09 05:55:40,533 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1934 transitions. Word has length 173 [2019-09-09 05:55:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:40,533 INFO L475 AbstractCegarLoop]: Abstraction has 1289 states and 1934 transitions. [2019-09-09 05:55:40,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1934 transitions. [2019-09-09 05:55:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 05:55:40,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:40,535 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:55:40,535 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2081372694, now seen corresponding path program 1 times [2019-09-09 05:55:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:55:40,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:40,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:40,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:40,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:40,630 INFO L87 Difference]: Start difference. First operand 1289 states and 1934 transitions. Second operand 4 states. [2019-09-09 05:55:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,050 INFO L93 Difference]: Finished difference Result 1480 states and 2194 transitions. [2019-09-09 05:55:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:41,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-09 05:55:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,053 INFO L225 Difference]: With dead ends: 1480 [2019-09-09 05:55:41,053 INFO L226 Difference]: Without dead ends: 1480 [2019-09-09 05:55:41,053 INFO L628 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-09 05:55:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-09 05:55:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1382. [2019-09-09 05:55:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-09 05:55:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2072 transitions. [2019-09-09 05:55:41,067 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2072 transitions. Word has length 174 [2019-09-09 05:55:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,068 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2072 transitions. [2019-09-09 05:55:41,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2072 transitions. [2019-09-09 05:55:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 05:55:41,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,070 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,070 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1107425607, now seen corresponding path program 1 times [2019-09-09 05:55:41,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-09 05:55:41,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:41,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:41,148 INFO L87 Difference]: Start difference. First operand 1382 states and 2072 transitions. Second operand 3 states. [2019-09-09 05:55:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,206 INFO L93 Difference]: Finished difference Result 1801 states and 2700 transitions. [2019-09-09 05:55:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:41,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-09 05:55:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,209 INFO L225 Difference]: With dead ends: 1801 [2019-09-09 05:55:41,209 INFO L226 Difference]: Without dead ends: 1801 [2019-09-09 05:55:41,209 INFO L628 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-09 05:55:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2019-09-09 05:55:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1795. [2019-09-09 05:55:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-09-09 05:55:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2695 transitions. [2019-09-09 05:55:41,239 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2695 transitions. Word has length 174 [2019-09-09 05:55:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,239 INFO L475 AbstractCegarLoop]: Abstraction has 1795 states and 2695 transitions. [2019-09-09 05:55:41,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2695 transitions. [2019-09-09 05:55:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 05:55:41,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,241 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,242 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash 159373641, now seen corresponding path program 1 times [2019-09-09 05:55:41,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-09 05:55:41,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:41,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:41,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:41,301 INFO L87 Difference]: Start difference. First operand 1795 states and 2695 transitions. Second operand 3 states. [2019-09-09 05:55:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,355 INFO L93 Difference]: Finished difference Result 1822 states and 2730 transitions. [2019-09-09 05:55:41,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:41,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-09 05:55:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,358 INFO L225 Difference]: With dead ends: 1822 [2019-09-09 05:55:41,358 INFO L226 Difference]: Without dead ends: 1822 [2019-09-09 05:55:41,358 INFO L628 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-09 05:55:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-09 05:55:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2019-09-09 05:55:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-09-09 05:55:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2730 transitions. [2019-09-09 05:55:41,383 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2730 transitions. Word has length 174 [2019-09-09 05:55:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,383 INFO L475 AbstractCegarLoop]: Abstraction has 1822 states and 2730 transitions. [2019-09-09 05:55:41,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2730 transitions. [2019-09-09 05:55:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 05:55:41,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,386 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,386 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 545236043, now seen corresponding path program 1 times [2019-09-09 05:55:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-09 05:55:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:41,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:41,455 INFO L87 Difference]: Start difference. First operand 1822 states and 2730 transitions. Second operand 3 states. [2019-09-09 05:55:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,488 INFO L93 Difference]: Finished difference Result 1824 states and 2732 transitions. [2019-09-09 05:55:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:41,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-09 05:55:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,490 INFO L225 Difference]: With dead ends: 1824 [2019-09-09 05:55:41,491 INFO L226 Difference]: Without dead ends: 1824 [2019-09-09 05:55:41,491 INFO L628 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-09 05:55:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-09-09 05:55:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-09-09 05:55:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2732 transitions. [2019-09-09 05:55:41,510 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2732 transitions. Word has length 174 [2019-09-09 05:55:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,510 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2732 transitions. [2019-09-09 05:55:41,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2732 transitions. [2019-09-09 05:55:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-09 05:55:41,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,514 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:41,514 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash 748465147, now seen corresponding path program 1 times [2019-09-09 05:55:41,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:41,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:41,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:41,584 INFO L87 Difference]: Start difference. First operand 1824 states and 2732 transitions. Second operand 4 states. [2019-09-09 05:55:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,917 INFO L93 Difference]: Finished difference Result 1969 states and 2915 transitions. [2019-09-09 05:55:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:41,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-09 05:55:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,920 INFO L225 Difference]: With dead ends: 1969 [2019-09-09 05:55:41,920 INFO L226 Difference]: Without dead ends: 1969 [2019-09-09 05:55:41,920 INFO L628 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-09 05:55:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-09 05:55:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-09 05:55:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2728 transitions. [2019-09-09 05:55:41,935 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2728 transitions. Word has length 178 [2019-09-09 05:55:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,936 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2728 transitions. [2019-09-09 05:55:41,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2728 transitions. [2019-09-09 05:55:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-09 05:55:41,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,938 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:41,938 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash 720059422, now seen corresponding path program 1 times [2019-09-09 05:55:41,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:42,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:42,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:42,030 INFO L87 Difference]: Start difference. First operand 1824 states and 2728 transitions. Second operand 4 states. [2019-09-09 05:55:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:42,366 INFO L93 Difference]: Finished difference Result 1969 states and 2911 transitions. [2019-09-09 05:55:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:42,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-09 05:55:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:42,368 INFO L225 Difference]: With dead ends: 1969 [2019-09-09 05:55:42,369 INFO L226 Difference]: Without dead ends: 1969 [2019-09-09 05:55:42,369 INFO L628 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-09 05:55:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-09 05:55:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-09 05:55:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2724 transitions. [2019-09-09 05:55:42,384 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2724 transitions. Word has length 179 [2019-09-09 05:55:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:42,384 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2724 transitions. [2019-09-09 05:55:42,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2724 transitions. [2019-09-09 05:55:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-09 05:55:42,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:42,385 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:42,386 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash 392419766, now seen corresponding path program 1 times [2019-09-09 05:55:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:42,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:42,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:42,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:42,465 INFO L87 Difference]: Start difference. First operand 1824 states and 2724 transitions. Second operand 4 states. [2019-09-09 05:55:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:42,798 INFO L93 Difference]: Finished difference Result 1969 states and 2907 transitions. [2019-09-09 05:55:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:42,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-09 05:55:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:42,801 INFO L225 Difference]: With dead ends: 1969 [2019-09-09 05:55:42,801 INFO L226 Difference]: Without dead ends: 1969 [2019-09-09 05:55:42,801 INFO L628 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-09 05:55:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-09 05:55:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-09 05:55:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2720 transitions. [2019-09-09 05:55:42,817 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2720 transitions. Word has length 180 [2019-09-09 05:55:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:42,818 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2720 transitions. [2019-09-09 05:55:42,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2720 transitions. [2019-09-09 05:55:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-09 05:55:42,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:42,820 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-09 05:55:42,820 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -621537159, now seen corresponding path program 1 times [2019-09-09 05:55:42,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:42,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:42,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:42,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:42,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:42,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:42,894 INFO L87 Difference]: Start difference. First operand 1824 states and 2720 transitions. Second operand 4 states. [2019-09-09 05:55:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:43,240 INFO L93 Difference]: Finished difference Result 1929 states and 2855 transitions. [2019-09-09 05:55:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:43,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-09 05:55:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:43,242 INFO L225 Difference]: With dead ends: 1929 [2019-09-09 05:55:43,243 INFO L226 Difference]: Without dead ends: 1929 [2019-09-09 05:55:43,243 INFO L628 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-09 05:55:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-09-09 05:55:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1824. [2019-09-09 05:55:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2716 transitions. [2019-09-09 05:55:43,254 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2716 transitions. Word has length 181 [2019-09-09 05:55:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:43,254 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2716 transitions. [2019-09-09 05:55:43,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2716 transitions. [2019-09-09 05:55:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-09 05:55:43,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:43,256 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2019-09-09 05:55:43,256 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash 940953982, now seen corresponding path program 1 times [2019-09-09 05:55:43,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:43,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:43,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:43,363 INFO L87 Difference]: Start difference. First operand 1824 states and 2716 transitions. Second operand 4 states. [2019-09-09 05:55:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:43,758 INFO L93 Difference]: Finished difference Result 1997 states and 2935 transitions. [2019-09-09 05:55:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:43,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-09 05:55:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:43,762 INFO L225 Difference]: With dead ends: 1997 [2019-09-09 05:55:43,762 INFO L226 Difference]: Without dead ends: 1997 [2019-09-09 05:55:43,762 INFO L628 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-09 05:55:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-09-09 05:55:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1824. [2019-09-09 05:55:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-09 05:55:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2712 transitions. [2019-09-09 05:55:43,775 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2712 transitions. Word has length 183 [2019-09-09 05:55:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:43,775 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2712 transitions. [2019-09-09 05:55:43,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2712 transitions. [2019-09-09 05:55:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-09 05:55:43,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:43,776 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2019-09-09 05:55:43,776 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721285, now seen corresponding path program 1 times [2019-09-09 05:55:43,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-09 05:55:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:43,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:43,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:43,893 INFO L87 Difference]: Start difference. First operand 1824 states and 2712 transitions. Second operand 5 states. [2019-09-09 05:55:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:44,366 INFO L93 Difference]: Finished difference Result 2278 states and 3395 transitions. [2019-09-09 05:55:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:44,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-09 05:55:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:44,369 INFO L225 Difference]: With dead ends: 2278 [2019-09-09 05:55:44,370 INFO L226 Difference]: Without dead ends: 2278 [2019-09-09 05:55:44,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:55:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-09-09 05:55:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1983. [2019-09-09 05:55:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-09-09 05:55:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2999 transitions. [2019-09-09 05:55:44,389 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2999 transitions. Word has length 184 [2019-09-09 05:55:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:44,389 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2999 transitions. [2019-09-09 05:55:44,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2999 transitions. [2019-09-09 05:55:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-09 05:55:44,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:44,391 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-09-09 05:55:44,391 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash -805780807, now seen corresponding path program 1 times [2019-09-09 05:55:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-09 05:55:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:44,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:44,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:44,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:44,501 INFO L87 Difference]: Start difference. First operand 1983 states and 2999 transitions. Second operand 5 states. [2019-09-09 05:55:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:44,966 INFO L93 Difference]: Finished difference Result 2390 states and 3615 transitions. [2019-09-09 05:55:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:44,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-09-09 05:55:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:44,969 INFO L225 Difference]: With dead ends: 2390 [2019-09-09 05:55:44,970 INFO L226 Difference]: Without dead ends: 2390 [2019-09-09 05:55:44,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:55:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2019-09-09 05:55:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2091. [2019-09-09 05:55:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-09-09 05:55:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3219 transitions. [2019-09-09 05:55:44,983 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3219 transitions. Word has length 185 [2019-09-09 05:55:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:44,983 INFO L475 AbstractCegarLoop]: Abstraction has 2091 states and 3219 transitions. [2019-09-09 05:55:44,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3219 transitions. [2019-09-09 05:55:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-09 05:55:44,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:44,985 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 05:55:44,985 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1186104476, now seen corresponding path program 1 times [2019-09-09 05:55:44,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:45,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:45,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:45,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2019-09-09 05:55:45,705 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [186], [188], [193], [198], [203], [208], [213], [218], [221], [312], [315], [323], [325], [328], [336], [341], [343], [345], [348], [357], [359], [362], [366], [369], [398], [403], [413], [415], [418], [429], [431], [441], [443], [448], [470], [472], [506], [511], [516], [521], [628], [662], [664], [676], [679], [680], [692], [700], [701], [702] [2019-09-09 05:55:45,776 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:45,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:45,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:45,828 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:55:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:45,831 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:45,902 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:45,903 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:45,908 INFO L420 sIntCurrentIteration]: We unified 196 AI predicates to 196 [2019-09-09 05:55:45,909 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:45,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:45,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-09-09 05:55:45,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:45,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:45,911 INFO L87 Difference]: Start difference. First operand 2091 states and 3219 transitions. Second operand 2 states. [2019-09-09 05:55:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:45,912 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:45,912 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 197 [2019-09-09 05:55:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:45,913 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:45,913 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:45,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:45,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2019-09-09 05:55:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:45,914 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:45,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:45,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:45,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:45 BoogieIcfgContainer [2019-09-09 05:55:45,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:45,926 INFO L168 Benchmark]: Toolchain (without parser) took 54360.06 ms. Allocated memory was 135.3 MB in the beginning and 710.4 MB in the end (delta: 575.1 MB). Free memory was 87.3 MB in the beginning and 458.2 MB in the end (delta: -371.0 MB). Peak memory consumption was 204.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,926 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.71 ms. Allocated memory was 135.3 MB in the beginning and 202.9 MB in the end (delta: 67.6 MB). Free memory was 87.0 MB in the beginning and 158.6 MB in the end (delta: -71.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,927 INFO L168 Benchmark]: Boogie Preprocessor took 177.36 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 150.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,928 INFO L168 Benchmark]: RCFGBuilder took 1687.73 ms. Allocated memory was 202.9 MB in the beginning and 232.3 MB in the end (delta: 29.4 MB). Free memory was 150.6 MB in the beginning and 167.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,929 INFO L168 Benchmark]: TraceAbstraction took 51614.47 ms. Allocated memory was 232.3 MB in the beginning and 710.4 MB in the end (delta: 478.2 MB). Free memory was 167.5 MB in the beginning and 458.2 MB in the end (delta: -290.7 MB). Peak memory consumption was 187.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:45,937 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 876.71 ms. Allocated memory was 135.3 MB in the beginning and 202.9 MB in the end (delta: 67.6 MB). Free memory was 87.0 MB in the beginning and 158.6 MB in the end (delta: -71.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.36 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 150.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1687.73 ms. Allocated memory was 202.9 MB in the beginning and 232.3 MB in the end (delta: 29.4 MB). Free memory was 150.6 MB in the beginning and 167.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51614.47 ms. Allocated memory was 232.3 MB in the beginning and 710.4 MB in the end (delta: 478.2 MB). Free memory was 167.5 MB in the beginning and 458.2 MB in the end (delta: -290.7 MB). Peak memory consumption was 187.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 189 locations, 1 error locations. SAFE Result, 51.5s OverallTime, 120 OverallIterations, 7 TraceHistogramMax, 40.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27608 SDtfs, 8205 SDslu, 40108 SDs, 0 SdLazy, 24223 SolverSat, 1103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 442 SyntacticMatches, 46 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2091occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.413265306122449 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 120 MinimizatonAttempts, 5415 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 15635 NumberOfCodeBlocks, 15635 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 15515 ConstructedInterpolants, 0 QuantifiedInterpolants, 5530471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 120 InterpolantComputations, 119 PerfectInterpolantSequences, 16461/16670 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...