java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:19,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:19,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:19,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:19,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:19,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:19,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:19,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:19,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:19,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:19,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:19,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:19,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:19,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:19,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:19,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:19,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:19,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:19,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:19,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:19,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:19,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:19,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:19,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:19,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:19,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:19,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:19,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:19,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:19,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:19,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:19,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:19,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:19,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:19,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:19,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:19,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:19,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:19,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:19,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:19,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:19,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:19,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:19,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:19,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:19,474 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:19,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:19,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:19,475 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:19,476 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:19,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:19,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:19,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:19,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:19,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:19,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:19,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:19,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:19,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:19,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:19,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:19,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:19,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:19,479 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:19,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:19,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:19,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:19,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:19,480 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:19,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:19,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:19,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:19,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:19,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:19,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:19,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:19,554 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:19,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-1.c [2019-09-20 13:27:19,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586982c28/d32264c22bbe4d84ace1ba3efdb55958/FLAG4a77077eb [2019-09-20 13:27:20,238 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:20,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-1.c [2019-09-20 13:27:20,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586982c28/d32264c22bbe4d84ace1ba3efdb55958/FLAG4a77077eb [2019-09-20 13:27:20,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586982c28/d32264c22bbe4d84ace1ba3efdb55958 [2019-09-20 13:27:20,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:20,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:20,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:20,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:20,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:20,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:20" (1/1) ... [2019-09-20 13:27:20,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3e23b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:20, skipping insertion in model container [2019-09-20 13:27:20,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:20" (1/1) ... [2019-09-20 13:27:20,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:20,608 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:21,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:21,294 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:21,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:21,503 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:21,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21 WrapperNode [2019-09-20 13:27:21,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:21,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:21,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:21,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:21,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... [2019-09-20 13:27:21,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:21,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:21,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:21,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:21,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:21,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:21,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:22,550 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:23,458 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:23,459 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:23,493 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:23,494 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:23,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:23 BoogieIcfgContainer [2019-09-20 13:27:23,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:23,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:23,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:23,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:23,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:20" (1/3) ... [2019-09-20 13:27:23,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de8a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:23, skipping insertion in model container [2019-09-20 13:27:23,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:21" (2/3) ... [2019-09-20 13:27:23,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de8a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:23, skipping insertion in model container [2019-09-20 13:27:23,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:23" (3/3) ... [2019-09-20 13:27:23,508 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2019-09-20 13:27:23,518 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:23,532 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:23,550 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:23,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:23,590 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:23,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:23,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:23,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:23,591 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:23,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:23,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-20 13:27:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:27:23,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,639 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,642 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash -232634089, now seen corresponding path program 1 times [2019-09-20 13:27:23,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,075 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2019-09-20 13:27:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,571 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-09-20 13:27:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:27:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,590 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:27:24,590 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:24,593 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-09-20 13:27:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-20 13:27:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2019-09-20 13:27:24,667 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 50 [2019-09-20 13:27:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,667 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2019-09-20 13:27:24,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2019-09-20 13:27:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:24,670 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,671 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,671 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash 349129836, now seen corresponding path program 1 times [2019-09-20 13:27:24,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,831 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand 4 states. [2019-09-20 13:27:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,250 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2019-09-20 13:27:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,253 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:25,254 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:25,255 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-09-20 13:27:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-20 13:27:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2019-09-20 13:27:25,266 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 63 [2019-09-20 13:27:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,266 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2019-09-20 13:27:25,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2019-09-20 13:27:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:25,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,269 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,269 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1878433696, now seen corresponding path program 1 times [2019-09-20 13:27:25,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,478 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand 4 states. [2019-09-20 13:27:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,824 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2019-09-20 13:27:25,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,829 INFO L225 Difference]: With dead ends: 179 [2019-09-20 13:27:25,829 INFO L226 Difference]: Without dead ends: 179 [2019-09-20 13:27:25,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-20 13:27:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2019-09-20 13:27:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-20 13:27:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2019-09-20 13:27:25,839 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 64 [2019-09-20 13:27:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,839 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2019-09-20 13:27:25,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2019-09-20 13:27:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:25,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,842 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,842 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash 780998220, now seen corresponding path program 1 times [2019-09-20 13:27:25,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:25,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,938 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand 5 states. [2019-09-20 13:27:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,496 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2019-09-20 13:27:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:26,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-20 13:27:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,498 INFO L225 Difference]: With dead ends: 184 [2019-09-20 13:27:26,499 INFO L226 Difference]: Without dead ends: 184 [2019-09-20 13:27:26,499 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-20 13:27:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-20 13:27:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 279 transitions. [2019-09-20 13:27:26,510 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 279 transitions. Word has length 64 [2019-09-20 13:27:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,511 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 279 transitions. [2019-09-20 13:27:26,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 279 transitions. [2019-09-20 13:27:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:26,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,514 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,514 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1214135404, now seen corresponding path program 1 times [2019-09-20 13:27:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,599 INFO L87 Difference]: Start difference. First operand 183 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,978 INFO L93 Difference]: Finished difference Result 198 states and 296 transitions. [2019-09-20 13:27:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,981 INFO L225 Difference]: With dead ends: 198 [2019-09-20 13:27:26,981 INFO L226 Difference]: Without dead ends: 198 [2019-09-20 13:27:26,981 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-20 13:27:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 183. [2019-09-20 13:27:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2019-09-20 13:27:27,005 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 64 [2019-09-20 13:27:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,006 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2019-09-20 13:27:27,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2019-09-20 13:27:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:27,008 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,009 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,009 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash 986471861, now seen corresponding path program 1 times [2019-09-20 13:27:27,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,118 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,436 INFO L93 Difference]: Finished difference Result 196 states and 293 transitions. [2019-09-20 13:27:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,439 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:27,439 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:27,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-20 13:27:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2019-09-20 13:27:27,448 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 64 [2019-09-20 13:27:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,449 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2019-09-20 13:27:27,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2019-09-20 13:27:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:27,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,459 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,460 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 922088847, now seen corresponding path program 1 times [2019-09-20 13:27:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,558 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,828 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-09-20 13:27:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,830 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:27,831 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:27,831 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-20 13:27:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2019-09-20 13:27:27,839 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 65 [2019-09-20 13:27:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,839 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2019-09-20 13:27:27,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2019-09-20 13:27:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:27,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,841 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,842 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1054711976, now seen corresponding path program 1 times [2019-09-20 13:27:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:27,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,929 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,224 INFO L93 Difference]: Finished difference Result 196 states and 291 transitions. [2019-09-20 13:27:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,226 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:28,226 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:28,227 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-20 13:27:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2019-09-20 13:27:28,233 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 66 [2019-09-20 13:27:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,234 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2019-09-20 13:27:28,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2019-09-20 13:27:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:28,235 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,235 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,236 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2050175156, now seen corresponding path program 1 times [2019-09-20 13:27:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,299 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,620 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2019-09-20 13:27:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,622 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:28,623 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:28,623 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-09-20 13:27:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-20 13:27:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 274 transitions. [2019-09-20 13:27:28,633 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 274 transitions. Word has length 67 [2019-09-20 13:27:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,633 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 274 transitions. [2019-09-20 13:27:28,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 274 transitions. [2019-09-20 13:27:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:28,639 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,639 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,639 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash -415898059, now seen corresponding path program 1 times [2019-09-20 13:27:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,745 INFO L87 Difference]: Start difference. First operand 183 states and 274 transitions. Second operand 4 states. [2019-09-20 13:27:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,071 INFO L93 Difference]: Finished difference Result 225 states and 336 transitions. [2019-09-20 13:27:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,075 INFO L225 Difference]: With dead ends: 225 [2019-09-20 13:27:29,075 INFO L226 Difference]: Without dead ends: 225 [2019-09-20 13:27:29,076 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-20 13:27:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2019-09-20 13:27:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2019-09-20 13:27:29,083 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 67 [2019-09-20 13:27:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,083 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2019-09-20 13:27:29,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2019-09-20 13:27:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:29,084 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,085 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash -521368355, now seen corresponding path program 1 times [2019-09-20 13:27:29,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,145 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand 4 states. [2019-09-20 13:27:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,424 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2019-09-20 13:27:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,427 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:29,427 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:29,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2019-09-20 13:27:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2019-09-20 13:27:29,434 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 68 [2019-09-20 13:27:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,434 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2019-09-20 13:27:29,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2019-09-20 13:27:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:29,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,436 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,436 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1287622642, now seen corresponding path program 1 times [2019-09-20 13:27:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,500 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand 4 states. [2019-09-20 13:27:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,826 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2019-09-20 13:27:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,829 INFO L225 Difference]: With dead ends: 225 [2019-09-20 13:27:29,829 INFO L226 Difference]: Without dead ends: 225 [2019-09-20 13:27:29,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-20 13:27:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2019-09-20 13:27:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2019-09-20 13:27:29,836 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 80 [2019-09-20 13:27:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,836 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2019-09-20 13:27:29,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2019-09-20 13:27:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:29,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,838 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,838 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash -413854670, now seen corresponding path program 1 times [2019-09-20 13:27:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,909 INFO L87 Difference]: Start difference. First operand 205 states and 309 transitions. Second operand 4 states. [2019-09-20 13:27:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,266 INFO L93 Difference]: Finished difference Result 224 states and 332 transitions. [2019-09-20 13:27:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,268 INFO L225 Difference]: With dead ends: 224 [2019-09-20 13:27:30,268 INFO L226 Difference]: Without dead ends: 224 [2019-09-20 13:27:30,269 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-20 13:27:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2019-09-20 13:27:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2019-09-20 13:27:30,281 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 81 [2019-09-20 13:27:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,283 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2019-09-20 13:27:30,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2019-09-20 13:27:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:30,285 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,285 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,285 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1786752595, now seen corresponding path program 1 times [2019-09-20 13:27:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,384 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand 4 states. [2019-09-20 13:27:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,755 INFO L93 Difference]: Finished difference Result 222 states and 329 transitions. [2019-09-20 13:27:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,758 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:27:30,758 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:27:30,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:27:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-20 13:27:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2019-09-20 13:27:30,764 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 81 [2019-09-20 13:27:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,764 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2019-09-20 13:27:30,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2019-09-20 13:27:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:30,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,766 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,766 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash -39012175, now seen corresponding path program 1 times [2019-09-20 13:27:30,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,828 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. Second operand 4 states. [2019-09-20 13:27:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,180 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-20 13:27:31,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,182 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:27:31,183 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:27:31,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:27:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-20 13:27:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2019-09-20 13:27:31,192 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 82 [2019-09-20 13:27:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,192 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2019-09-20 13:27:31,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2019-09-20 13:27:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:31,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,194 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,195 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash -784072586, now seen corresponding path program 1 times [2019-09-20 13:27:31,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:31,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,272 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 4 states. [2019-09-20 13:27:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,585 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2019-09-20 13:27:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,587 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:27:31,587 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:27:31,587 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:27:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-20 13:27:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2019-09-20 13:27:31,594 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 83 [2019-09-20 13:27:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,594 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2019-09-20 13:27:31,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2019-09-20 13:27:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:31,596 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,596 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,597 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1850061654, now seen corresponding path program 1 times [2019-09-20 13:27:31,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:31,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,662 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand 4 states. [2019-09-20 13:27:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,954 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2019-09-20 13:27:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,956 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:27:31,956 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:27:31,956 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:27:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-09-20 13:27:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2019-09-20 13:27:31,963 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 84 [2019-09-20 13:27:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,963 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2019-09-20 13:27:31,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2019-09-20 13:27:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:31,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,965 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,965 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1865047675, now seen corresponding path program 1 times [2019-09-20 13:27:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:32,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,034 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand 4 states. [2019-09-20 13:27:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,327 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2019-09-20 13:27:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,329 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:32,329 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:32,329 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2019-09-20 13:27:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:27:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 303 transitions. [2019-09-20 13:27:32,335 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 303 transitions. Word has length 85 [2019-09-20 13:27:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,335 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 303 transitions. [2019-09-20 13:27:32,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 303 transitions. [2019-09-20 13:27:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:27:32,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,337 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,337 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -530152541, now seen corresponding path program 1 times [2019-09-20 13:27:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,433 INFO L87 Difference]: Start difference. First operand 205 states and 303 transitions. Second operand 4 states. [2019-09-20 13:27:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,891 INFO L93 Difference]: Finished difference Result 319 states and 480 transitions. [2019-09-20 13:27:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:27:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,893 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:27:32,893 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:27:32,894 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:27:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 246. [2019-09-20 13:27:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-20 13:27:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 376 transitions. [2019-09-20 13:27:32,901 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 376 transitions. Word has length 89 [2019-09-20 13:27:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,901 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 376 transitions. [2019-09-20 13:27:32,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2019-09-20 13:27:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:27:32,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,903 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,903 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash -282006047, now seen corresponding path program 1 times [2019-09-20 13:27:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,966 INFO L87 Difference]: Start difference. First operand 246 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,308 INFO L93 Difference]: Finished difference Result 295 states and 449 transitions. [2019-09-20 13:27:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:27:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,312 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:33,312 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:33,312 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 270. [2019-09-20 13:27:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-20 13:27:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 417 transitions. [2019-09-20 13:27:33,320 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 417 transitions. Word has length 89 [2019-09-20 13:27:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,320 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 417 transitions. [2019-09-20 13:27:33,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 417 transitions. [2019-09-20 13:27:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:33,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,322 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,322 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1774496135, now seen corresponding path program 1 times [2019-09-20 13:27:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,400 INFO L87 Difference]: Start difference. First operand 270 states and 417 transitions. Second operand 4 states. [2019-09-20 13:27:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,990 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-09-20 13:27:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,994 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:27:33,994 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:27:33,995 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:27:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2019-09-20 13:27:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 418 transitions. [2019-09-20 13:27:34,003 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 418 transitions. Word has length 90 [2019-09-20 13:27:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,004 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 418 transitions. [2019-09-20 13:27:34,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 418 transitions. [2019-09-20 13:27:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:34,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,006 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,006 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 973313376, now seen corresponding path program 1 times [2019-09-20 13:27:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,075 INFO L87 Difference]: Start difference. First operand 271 states and 418 transitions. Second operand 4 states. [2019-09-20 13:27:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,598 INFO L93 Difference]: Finished difference Result 334 states and 506 transitions. [2019-09-20 13:27:34,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,607 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:27:34,608 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:27:34,608 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:27:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2019-09-20 13:27:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 417 transitions. [2019-09-20 13:27:34,620 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 417 transitions. Word has length 102 [2019-09-20 13:27:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,621 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 417 transitions. [2019-09-20 13:27:34,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 417 transitions. [2019-09-20 13:27:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:34,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,624 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,625 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1934868510, now seen corresponding path program 1 times [2019-09-20 13:27:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,766 INFO L87 Difference]: Start difference. First operand 271 states and 417 transitions. Second operand 4 states. [2019-09-20 13:27:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,148 INFO L93 Difference]: Finished difference Result 296 states and 448 transitions. [2019-09-20 13:27:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,151 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:27:35,152 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:27:35,153 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:27:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-20 13:27:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2019-09-20 13:27:35,169 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 102 [2019-09-20 13:27:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,170 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2019-09-20 13:27:35,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2019-09-20 13:27:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:35,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,173 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,173 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 955685152, now seen corresponding path program 1 times [2019-09-20 13:27:35,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:35,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,332 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand 4 states. [2019-09-20 13:27:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,895 INFO L93 Difference]: Finished difference Result 333 states and 503 transitions. [2019-09-20 13:27:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,898 INFO L225 Difference]: With dead ends: 333 [2019-09-20 13:27:35,899 INFO L226 Difference]: Without dead ends: 333 [2019-09-20 13:27:35,900 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-20 13:27:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 271. [2019-09-20 13:27:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 415 transitions. [2019-09-20 13:27:35,909 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 415 transitions. Word has length 103 [2019-09-20 13:27:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,909 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 415 transitions. [2019-09-20 13:27:35,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 415 transitions. [2019-09-20 13:27:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:35,911 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,911 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,911 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1138674879, now seen corresponding path program 1 times [2019-09-20 13:27:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,038 INFO L87 Difference]: Start difference. First operand 271 states and 415 transitions. Second operand 4 states. [2019-09-20 13:27:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,528 INFO L93 Difference]: Finished difference Result 331 states and 500 transitions. [2019-09-20 13:27:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,530 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:27:36,530 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:27:36,531 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:27:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-20 13:27:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2019-09-20 13:27:36,538 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 103 [2019-09-20 13:27:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,538 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2019-09-20 13:27:36,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2019-09-20 13:27:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:36,540 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,540 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,540 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 996359902, now seen corresponding path program 1 times [2019-09-20 13:27:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,622 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand 4 states. [2019-09-20 13:27:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,941 INFO L93 Difference]: Finished difference Result 295 states and 444 transitions. [2019-09-20 13:27:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,944 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:36,945 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:36,945 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 271. [2019-09-20 13:27:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2019-09-20 13:27:36,952 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 103 [2019-09-20 13:27:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,953 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2019-09-20 13:27:36,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2019-09-20 13:27:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:36,954 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,954 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,955 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1098000129, now seen corresponding path program 1 times [2019-09-20 13:27:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,036 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand 4 states. [2019-09-20 13:27:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,375 INFO L93 Difference]: Finished difference Result 293 states and 441 transitions. [2019-09-20 13:27:37,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,377 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:27:37,377 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:27:37,378 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:27:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-20 13:27:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-09-20 13:27:37,383 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 103 [2019-09-20 13:27:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,384 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-09-20 13:27:37,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-09-20 13:27:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:37,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,386 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,386 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash -532950653, now seen corresponding path program 1 times [2019-09-20 13:27:37,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,446 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 4 states. [2019-09-20 13:27:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,881 INFO L93 Difference]: Finished difference Result 331 states and 497 transitions. [2019-09-20 13:27:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,884 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:27:37,884 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:27:37,884 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:27:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-20 13:27:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2019-09-20 13:27:37,891 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 104 [2019-09-20 13:27:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,891 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2019-09-20 13:27:37,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2019-09-20 13:27:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:37,892 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,893 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,893 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 727966597, now seen corresponding path program 1 times [2019-09-20 13:27:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,953 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 4 states. [2019-09-20 13:27:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,260 INFO L93 Difference]: Finished difference Result 293 states and 439 transitions. [2019-09-20 13:27:38,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,262 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:27:38,263 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:27:38,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:27:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-20 13:27:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 410 transitions. [2019-09-20 13:27:38,270 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 410 transitions. Word has length 104 [2019-09-20 13:27:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,270 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 410 transitions. [2019-09-20 13:27:38,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 410 transitions. [2019-09-20 13:27:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:38,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,272 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,272 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1083703780, now seen corresponding path program 1 times [2019-09-20 13:27:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,338 INFO L87 Difference]: Start difference. First operand 271 states and 410 transitions. Second operand 4 states. [2019-09-20 13:27:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,794 INFO L93 Difference]: Finished difference Result 331 states and 495 transitions. [2019-09-20 13:27:38,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,796 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:27:38,796 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:27:38,797 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:27:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-20 13:27:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-09-20 13:27:38,804 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 105 [2019-09-20 13:27:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,804 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-09-20 13:27:38,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-09-20 13:27:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:38,805 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,805 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,806 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1517432866, now seen corresponding path program 1 times [2019-09-20 13:27:38,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,882 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 4 states. [2019-09-20 13:27:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,187 INFO L93 Difference]: Finished difference Result 293 states and 437 transitions. [2019-09-20 13:27:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,190 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:27:39,191 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:27:39,191 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:27:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-20 13:27:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 408 transitions. [2019-09-20 13:27:39,198 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 408 transitions. Word has length 105 [2019-09-20 13:27:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,198 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 408 transitions. [2019-09-20 13:27:39,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 408 transitions. [2019-09-20 13:27:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:39,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,200 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,200 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash -378413144, now seen corresponding path program 1 times [2019-09-20 13:27:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:39,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,269 INFO L87 Difference]: Start difference. First operand 271 states and 408 transitions. Second operand 4 states. [2019-09-20 13:27:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,686 INFO L93 Difference]: Finished difference Result 331 states and 493 transitions. [2019-09-20 13:27:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,688 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:27:39,689 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:27:39,689 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:27:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2019-09-20 13:27:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 407 transitions. [2019-09-20 13:27:39,696 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 407 transitions. Word has length 106 [2019-09-20 13:27:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,696 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 407 transitions. [2019-09-20 13:27:39,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 407 transitions. [2019-09-20 13:27:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:39,697 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,697 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,698 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash 182286634, now seen corresponding path program 1 times [2019-09-20 13:27:39,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:39,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,772 INFO L87 Difference]: Start difference. First operand 271 states and 407 transitions. Second operand 4 states. [2019-09-20 13:27:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,121 INFO L93 Difference]: Finished difference Result 293 states and 435 transitions. [2019-09-20 13:27:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,124 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:27:40,125 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:27:40,126 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:27:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2019-09-20 13:27:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2019-09-20 13:27:40,133 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 406 transitions. Word has length 106 [2019-09-20 13:27:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,133 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 406 transitions. [2019-09-20 13:27:40,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 406 transitions. [2019-09-20 13:27:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:40,135 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,135 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,135 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1501805673, now seen corresponding path program 1 times [2019-09-20 13:27:40,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:40,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,223 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. Second operand 4 states. [2019-09-20 13:27:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,628 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2019-09-20 13:27:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,631 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:27:40,631 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:27:40,632 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:27:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2019-09-20 13:27:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 405 transitions. [2019-09-20 13:27:40,639 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 405 transitions. Word has length 107 [2019-09-20 13:27:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,639 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 405 transitions. [2019-09-20 13:27:40,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 405 transitions. [2019-09-20 13:27:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:40,640 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,641 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,641 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1703629607, now seen corresponding path program 1 times [2019-09-20 13:27:40,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:40,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,710 INFO L87 Difference]: Start difference. First operand 271 states and 405 transitions. Second operand 4 states. [2019-09-20 13:27:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,004 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2019-09-20 13:27:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,007 INFO L225 Difference]: With dead ends: 283 [2019-09-20 13:27:41,007 INFO L226 Difference]: Without dead ends: 283 [2019-09-20 13:27:41,008 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-20 13:27:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 271. [2019-09-20 13:27:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 404 transitions. [2019-09-20 13:27:41,013 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 404 transitions. Word has length 107 [2019-09-20 13:27:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,013 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 404 transitions. [2019-09-20 13:27:41,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 404 transitions. [2019-09-20 13:27:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:27:41,015 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,015 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,015 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1624523651, now seen corresponding path program 1 times [2019-09-20 13:27:41,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:41,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,105 INFO L87 Difference]: Start difference. First operand 271 states and 404 transitions. Second operand 4 states. [2019-09-20 13:27:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,501 INFO L93 Difference]: Finished difference Result 321 states and 477 transitions. [2019-09-20 13:27:41,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:27:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,504 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:27:41,504 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:27:41,505 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:27:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2019-09-20 13:27:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-20 13:27:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 403 transitions. [2019-09-20 13:27:41,511 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 403 transitions. Word has length 111 [2019-09-20 13:27:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,511 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 403 transitions. [2019-09-20 13:27:41,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 403 transitions. [2019-09-20 13:27:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:27:41,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,513 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,513 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1570130753, now seen corresponding path program 1 times [2019-09-20 13:27:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,602 INFO L87 Difference]: Start difference. First operand 271 states and 403 transitions. Second operand 4 states. [2019-09-20 13:27:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,923 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-09-20 13:27:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:27:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,926 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:27:41,926 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:27:41,927 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:27:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 297. [2019-09-20 13:27:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 448 transitions. [2019-09-20 13:27:41,933 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 448 transitions. Word has length 111 [2019-09-20 13:27:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,934 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 448 transitions. [2019-09-20 13:27:41,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 448 transitions. [2019-09-20 13:27:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:27:41,935 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,936 INFO L407 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, 1] [2019-09-20 13:27:41,936 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1144392861, now seen corresponding path program 1 times [2019-09-20 13:27:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,007 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-20 13:27:42,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,008 INFO L87 Difference]: Start difference. First operand 297 states and 448 transitions. Second operand 4 states. [2019-09-20 13:27:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,411 INFO L93 Difference]: Finished difference Result 347 states and 521 transitions. [2019-09-20 13:27:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:27:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,413 INFO L225 Difference]: With dead ends: 347 [2019-09-20 13:27:42,413 INFO L226 Difference]: Without dead ends: 347 [2019-09-20 13:27:42,413 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-20 13:27:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 297. [2019-09-20 13:27:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2019-09-20 13:27:42,420 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 114 [2019-09-20 13:27:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,420 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2019-09-20 13:27:42,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2019-09-20 13:27:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:27:42,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,422 INFO L407 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, 1] [2019-09-20 13:27:42,422 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2115681404, now seen corresponding path program 1 times [2019-09-20 13:27:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,499 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-20 13:27:42,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,500 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand 4 states. [2019-09-20 13:27:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,866 INFO L93 Difference]: Finished difference Result 339 states and 507 transitions. [2019-09-20 13:27:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:27:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,869 INFO L225 Difference]: With dead ends: 339 [2019-09-20 13:27:42,869 INFO L226 Difference]: Without dead ends: 339 [2019-09-20 13:27:42,870 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-20 13:27:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-20 13:27:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2019-09-20 13:27:42,875 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 115 [2019-09-20 13:27:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,875 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2019-09-20 13:27:42,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2019-09-20 13:27:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:27:42,876 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,876 INFO L407 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, 1] [2019-09-20 13:27:42,877 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1421422653, now seen corresponding path program 1 times [2019-09-20 13:27:42,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,957 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-20 13:27:42,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,959 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand 4 states. [2019-09-20 13:27:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,324 INFO L93 Difference]: Finished difference Result 339 states and 506 transitions. [2019-09-20 13:27:43,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:27:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,328 INFO L225 Difference]: With dead ends: 339 [2019-09-20 13:27:43,328 INFO L226 Difference]: Without dead ends: 339 [2019-09-20 13:27:43,328 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-20 13:27:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-20 13:27:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 445 transitions. [2019-09-20 13:27:43,334 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 445 transitions. Word has length 116 [2019-09-20 13:27:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,334 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 445 transitions. [2019-09-20 13:27:43,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 445 transitions. [2019-09-20 13:27:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:27:43,335 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,336 INFO L407 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, 1] [2019-09-20 13:27:43,336 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2095280754, now seen corresponding path program 1 times [2019-09-20 13:27:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,408 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-20 13:27:43,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,410 INFO L87 Difference]: Start difference. First operand 297 states and 445 transitions. Second operand 4 states. [2019-09-20 13:27:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,793 INFO L93 Difference]: Finished difference Result 339 states and 505 transitions. [2019-09-20 13:27:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:27:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,796 INFO L225 Difference]: With dead ends: 339 [2019-09-20 13:27:43,796 INFO L226 Difference]: Without dead ends: 339 [2019-09-20 13:27:43,796 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-20 13:27:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2019-09-20 13:27:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-20 13:27:43,801 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 117 [2019-09-20 13:27:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,802 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-20 13:27:43,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-20 13:27:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:27:43,803 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,803 INFO L407 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, 1] [2019-09-20 13:27:43,803 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1598827452, now seen corresponding path program 1 times [2019-09-20 13:27:43,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,881 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-20 13:27:43,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,882 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 4 states. [2019-09-20 13:27:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,258 INFO L93 Difference]: Finished difference Result 337 states and 502 transitions. [2019-09-20 13:27:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:27:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,260 INFO L225 Difference]: With dead ends: 337 [2019-09-20 13:27:44,260 INFO L226 Difference]: Without dead ends: 337 [2019-09-20 13:27:44,261 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-20 13:27:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2019-09-20 13:27:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 443 transitions. [2019-09-20 13:27:44,266 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 443 transitions. Word has length 117 [2019-09-20 13:27:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,266 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 443 transitions. [2019-09-20 13:27:44,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2019-09-20 13:27:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:27:44,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,267 INFO L407 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, 1] [2019-09-20 13:27:44,268 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2094381677, now seen corresponding path program 1 times [2019-09-20 13:27:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,349 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-20 13:27:44,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,351 INFO L87 Difference]: Start difference. First operand 297 states and 443 transitions. Second operand 4 states. [2019-09-20 13:27:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,706 INFO L93 Difference]: Finished difference Result 335 states and 498 transitions. [2019-09-20 13:27:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-20 13:27:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,708 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:27:44,708 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:27:44,708 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:27:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 297. [2019-09-20 13:27:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 442 transitions. [2019-09-20 13:27:44,713 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 442 transitions. Word has length 118 [2019-09-20 13:27:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,714 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 442 transitions. [2019-09-20 13:27:44,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2019-09-20 13:27:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:27:44,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,715 INFO L407 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, 1] [2019-09-20 13:27:44,715 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1839467173, now seen corresponding path program 1 times [2019-09-20 13:27:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,784 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-20 13:27:44,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,785 INFO L87 Difference]: Start difference. First operand 297 states and 442 transitions. Second operand 4 states. [2019-09-20 13:27:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,110 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2019-09-20 13:27:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-20 13:27:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,114 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:45,114 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:45,114 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2019-09-20 13:27:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2019-09-20 13:27:45,120 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 118 [2019-09-20 13:27:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,121 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2019-09-20 13:27:45,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2019-09-20 13:27:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:27:45,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,123 INFO L407 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, 1, 1] [2019-09-20 13:27:45,123 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1659588588, now seen corresponding path program 1 times [2019-09-20 13:27:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,231 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-20 13:27:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,232 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand 4 states. [2019-09-20 13:27:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,594 INFO L93 Difference]: Finished difference Result 332 states and 492 transitions. [2019-09-20 13:27:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:27:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,597 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:27:45,597 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:27:45,597 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:27:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2019-09-20 13:27:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 440 transitions. [2019-09-20 13:27:45,602 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 440 transitions. Word has length 121 [2019-09-20 13:27:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,603 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 440 transitions. [2019-09-20 13:27:45,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2019-09-20 13:27:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:27:45,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,604 INFO L407 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, 1, 1] [2019-09-20 13:27:45,604 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1761494000, now seen corresponding path program 1 times [2019-09-20 13:27:45,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,676 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-20 13:27:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,678 INFO L87 Difference]: Start difference. First operand 297 states and 440 transitions. Second operand 4 states. [2019-09-20 13:27:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,045 INFO L93 Difference]: Finished difference Result 326 states and 482 transitions. [2019-09-20 13:27:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:27:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,049 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:27:46,049 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:27:46,049 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:27:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2019-09-20 13:27:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 439 transitions. [2019-09-20 13:27:46,054 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 439 transitions. Word has length 122 [2019-09-20 13:27:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,054 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 439 transitions. [2019-09-20 13:27:46,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2019-09-20 13:27:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:27:46,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,055 INFO L407 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, 1, 1] [2019-09-20 13:27:46,056 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash -427889517, now seen corresponding path program 1 times [2019-09-20 13:27:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,126 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-20 13:27:46,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,128 INFO L87 Difference]: Start difference. First operand 297 states and 439 transitions. Second operand 4 states. [2019-09-20 13:27:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,599 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2019-09-20 13:27:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:27:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,602 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:27:46,602 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:27:46,603 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:27:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2019-09-20 13:27:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 438 transitions. [2019-09-20 13:27:46,609 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 438 transitions. Word has length 122 [2019-09-20 13:27:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,609 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 438 transitions. [2019-09-20 13:27:46,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 438 transitions. [2019-09-20 13:27:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:27:46,611 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,611 INFO L407 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, 1, 1] [2019-09-20 13:27:46,611 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1988908143, now seen corresponding path program 1 times [2019-09-20 13:27:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,687 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-20 13:27:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,690 INFO L87 Difference]: Start difference. First operand 297 states and 438 transitions. Second operand 4 states. [2019-09-20 13:27:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,041 INFO L93 Difference]: Finished difference Result 323 states and 476 transitions. [2019-09-20 13:27:47,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:27:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,046 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:47,046 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:47,046 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2019-09-20 13:27:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 437 transitions. [2019-09-20 13:27:47,053 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 437 transitions. Word has length 123 [2019-09-20 13:27:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,054 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 437 transitions. [2019-09-20 13:27:47,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 437 transitions. [2019-09-20 13:27:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:27:47,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,055 INFO L407 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, 1, 1] [2019-09-20 13:27:47,055 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash -547194789, now seen corresponding path program 1 times [2019-09-20 13:27:47,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,132 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-20 13:27:47,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,134 INFO L87 Difference]: Start difference. First operand 297 states and 437 transitions. Second operand 4 states. [2019-09-20 13:27:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,495 INFO L93 Difference]: Finished difference Result 323 states and 475 transitions. [2019-09-20 13:27:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:27:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,497 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:47,497 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:47,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2019-09-20 13:27:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-20 13:27:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2019-09-20 13:27:47,501 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 436 transitions. Word has length 124 [2019-09-20 13:27:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,502 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 436 transitions. [2019-09-20 13:27:47,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 436 transitions. [2019-09-20 13:27:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:27:47,503 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,503 INFO L407 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, 1] [2019-09-20 13:27:47,503 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1345216894, now seen corresponding path program 1 times [2019-09-20 13:27:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,577 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-20 13:27:47,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,579 INFO L87 Difference]: Start difference. First operand 297 states and 436 transitions. Second operand 4 states. [2019-09-20 13:27:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,013 INFO L93 Difference]: Finished difference Result 369 states and 547 transitions. [2019-09-20 13:27:48,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:27:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,015 INFO L225 Difference]: With dead ends: 369 [2019-09-20 13:27:48,016 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:27:48,016 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:27:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 329. [2019-09-20 13:27:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-20 13:27:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 493 transitions. [2019-09-20 13:27:48,022 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 493 transitions. Word has length 124 [2019-09-20 13:27:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,022 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 493 transitions. [2019-09-20 13:27:48,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 493 transitions. [2019-09-20 13:27:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:27:48,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,024 INFO L407 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, 1, 1] [2019-09-20 13:27:48,024 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1970746519, now seen corresponding path program 1 times [2019-09-20 13:27:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,108 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-20 13:27:48,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,110 INFO L87 Difference]: Start difference. First operand 329 states and 493 transitions. Second operand 4 states. [2019-09-20 13:27:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,447 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2019-09-20 13:27:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:27:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,450 INFO L225 Difference]: With dead ends: 352 [2019-09-20 13:27:48,450 INFO L226 Difference]: Without dead ends: 352 [2019-09-20 13:27:48,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-20 13:27:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2019-09-20 13:27:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-20 13:27:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2019-09-20 13:27:48,454 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 125 [2019-09-20 13:27:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,455 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2019-09-20 13:27:48,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2019-09-20 13:27:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:27:48,456 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,456 INFO L407 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-20 13:27:48,456 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2095690814, now seen corresponding path program 1 times [2019-09-20 13:27:48,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,527 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-20 13:27:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,528 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand 4 states. [2019-09-20 13:27:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,025 INFO L93 Difference]: Finished difference Result 441 states and 667 transitions. [2019-09-20 13:27:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:27:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,028 INFO L225 Difference]: With dead ends: 441 [2019-09-20 13:27:49,028 INFO L226 Difference]: Without dead ends: 441 [2019-09-20 13:27:49,028 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-20 13:27:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 368. [2019-09-20 13:27:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-20 13:27:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 563 transitions. [2019-09-20 13:27:49,033 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 563 transitions. Word has length 125 [2019-09-20 13:27:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,034 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 563 transitions. [2019-09-20 13:27:49,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 563 transitions. [2019-09-20 13:27:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:27:49,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,035 INFO L407 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, 1] [2019-09-20 13:27:49,036 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 447486501, now seen corresponding path program 1 times [2019-09-20 13:27:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,100 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-20 13:27:49,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,102 INFO L87 Difference]: Start difference. First operand 368 states and 563 transitions. Second operand 4 states. [2019-09-20 13:27:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,440 INFO L93 Difference]: Finished difference Result 395 states and 597 transitions. [2019-09-20 13:27:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:27:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,444 INFO L225 Difference]: With dead ends: 395 [2019-09-20 13:27:49,444 INFO L226 Difference]: Without dead ends: 395 [2019-09-20 13:27:49,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-20 13:27:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 368. [2019-09-20 13:27:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-20 13:27:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2019-09-20 13:27:49,448 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 126 [2019-09-20 13:27:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,449 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2019-09-20 13:27:49,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2019-09-20 13:27:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:27:49,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,450 INFO L407 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, 1] [2019-09-20 13:27:49,450 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1571261516, now seen corresponding path program 1 times [2019-09-20 13:27:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,523 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-20 13:27:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,524 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand 4 states. [2019-09-20 13:27:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,993 INFO L93 Difference]: Finished difference Result 432 states and 652 transitions. [2019-09-20 13:27:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:27:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,997 INFO L225 Difference]: With dead ends: 432 [2019-09-20 13:27:49,997 INFO L226 Difference]: Without dead ends: 432 [2019-09-20 13:27:49,997 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-20 13:27:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2019-09-20 13:27:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-20 13:27:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 561 transitions. [2019-09-20 13:27:50,001 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 561 transitions. Word has length 126 [2019-09-20 13:27:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,001 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 561 transitions. [2019-09-20 13:27:50,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2019-09-20 13:27:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:27:50,002 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,002 INFO L407 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, 1] [2019-09-20 13:27:50,003 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1412484482, now seen corresponding path program 1 times [2019-09-20 13:27:50,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,073 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-20 13:27:50,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,074 INFO L87 Difference]: Start difference. First operand 367 states and 561 transitions. Second operand 4 states. [2019-09-20 13:27:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,417 INFO L93 Difference]: Finished difference Result 394 states and 595 transitions. [2019-09-20 13:27:50,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:27:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,420 INFO L225 Difference]: With dead ends: 394 [2019-09-20 13:27:50,420 INFO L226 Difference]: Without dead ends: 394 [2019-09-20 13:27:50,420 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-20 13:27:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2019-09-20 13:27:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-20 13:27:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 560 transitions. [2019-09-20 13:27:50,424 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 560 transitions. Word has length 127 [2019-09-20 13:27:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,424 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 560 transitions. [2019-09-20 13:27:50,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 560 transitions. [2019-09-20 13:27:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:27:50,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,426 INFO L407 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, 1] [2019-09-20 13:27:50,426 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1223854026, now seen corresponding path program 1 times [2019-09-20 13:27:50,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,500 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-20 13:27:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,502 INFO L87 Difference]: Start difference. First operand 367 states and 560 transitions. Second operand 4 states. [2019-09-20 13:27:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,856 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2019-09-20 13:27:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:27:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,858 INFO L225 Difference]: With dead ends: 394 [2019-09-20 13:27:50,858 INFO L226 Difference]: Without dead ends: 394 [2019-09-20 13:27:50,859 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-20 13:27:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2019-09-20 13:27:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-20 13:27:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 559 transitions. [2019-09-20 13:27:50,864 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 559 transitions. Word has length 128 [2019-09-20 13:27:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,864 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 559 transitions. [2019-09-20 13:27:50,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 559 transitions. [2019-09-20 13:27:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:27:50,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,865 INFO L407 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, 1] [2019-09-20 13:27:50,865 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash -367519609, now seen corresponding path program 1 times [2019-09-20 13:27:50,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,939 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-20 13:27:50,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,941 INFO L87 Difference]: Start difference. First operand 367 states and 559 transitions. Second operand 4 states. [2019-09-20 13:27:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,260 INFO L93 Difference]: Finished difference Result 384 states and 581 transitions. [2019-09-20 13:27:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:27:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,263 INFO L225 Difference]: With dead ends: 384 [2019-09-20 13:27:51,263 INFO L226 Difference]: Without dead ends: 384 [2019-09-20 13:27:51,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-20 13:27:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 367. [2019-09-20 13:27:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-20 13:27:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2019-09-20 13:27:51,268 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 129 [2019-09-20 13:27:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,268 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2019-09-20 13:27:51,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2019-09-20 13:27:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:27:51,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,269 INFO L407 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] [2019-09-20 13:27:51,270 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2095643265, now seen corresponding path program 1 times [2019-09-20 13:27:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,337 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-20 13:27:51,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:51,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:51,339 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand 3 states. [2019-09-20 13:27:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,473 INFO L93 Difference]: Finished difference Result 705 states and 1065 transitions. [2019-09-20 13:27:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:51,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-20 13:27:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,477 INFO L225 Difference]: With dead ends: 705 [2019-09-20 13:27:51,478 INFO L226 Difference]: Without dead ends: 705 [2019-09-20 13:27:51,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-20 13:27:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 703. [2019-09-20 13:27:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-20 13:27:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2019-09-20 13:27:51,488 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 130 [2019-09-20 13:27:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,489 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2019-09-20 13:27:51,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2019-09-20 13:27:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:27:51,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,491 INFO L407 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, 1, 1] [2019-09-20 13:27:51,491 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -17161460, now seen corresponding path program 1 times [2019-09-20 13:27:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,575 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-20 13:27:51,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,577 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2019-09-20 13:27:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,088 INFO L93 Difference]: Finished difference Result 923 states and 1398 transitions. [2019-09-20 13:27:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-20 13:27:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,094 INFO L225 Difference]: With dead ends: 923 [2019-09-20 13:27:52,094 INFO L226 Difference]: Without dead ends: 923 [2019-09-20 13:27:52,094 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-20 13:27:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 781. [2019-09-20 13:27:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-20 13:27:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1206 transitions. [2019-09-20 13:27:52,102 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1206 transitions. Word has length 133 [2019-09-20 13:27:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,103 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1206 transitions. [2019-09-20 13:27:52,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1206 transitions. [2019-09-20 13:27:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-20 13:27:52,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,104 INFO L407 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, 1, 1, 1, 1] [2019-09-20 13:27:52,104 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 497350462, now seen corresponding path program 1 times [2019-09-20 13:27:52,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,185 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-20 13:27:52,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,187 INFO L87 Difference]: Start difference. First operand 781 states and 1206 transitions. Second operand 4 states. [2019-09-20 13:27:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,682 INFO L93 Difference]: Finished difference Result 909 states and 1378 transitions. [2019-09-20 13:27:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-20 13:27:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,687 INFO L225 Difference]: With dead ends: 909 [2019-09-20 13:27:52,687 INFO L226 Difference]: Without dead ends: 909 [2019-09-20 13:27:52,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-20 13:27:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 703. [2019-09-20 13:27:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-20 13:27:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2019-09-20 13:27:52,698 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 134 [2019-09-20 13:27:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,698 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2019-09-20 13:27:52,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2019-09-20 13:27:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-20 13:27:52,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,700 INFO L407 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, 1, 1, 1, 1] [2019-09-20 13:27:52,701 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1370532881, now seen corresponding path program 1 times [2019-09-20 13:27:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,795 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-20 13:27:52,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,797 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2019-09-20 13:27:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,158 INFO L93 Difference]: Finished difference Result 735 states and 1106 transitions. [2019-09-20 13:27:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-20 13:27:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,162 INFO L225 Difference]: With dead ends: 735 [2019-09-20 13:27:53,162 INFO L226 Difference]: Without dead ends: 735 [2019-09-20 13:27:53,163 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-20 13:27:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 709. [2019-09-20 13:27:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-20 13:27:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1070 transitions. [2019-09-20 13:27:53,173 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1070 transitions. Word has length 135 [2019-09-20 13:27:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,174 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1070 transitions. [2019-09-20 13:27:53,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1070 transitions. [2019-09-20 13:27:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-20 13:27:53,176 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,176 INFO L407 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, 1] [2019-09-20 13:27:53,176 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1007271108, now seen corresponding path program 1 times [2019-09-20 13:27:53,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat