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.14.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:59,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:59,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:59,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:59,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:59,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:59,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:59,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:59,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:59,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:59,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:59,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:59,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:59,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:59,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:59,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:59,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:59,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:59,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:59,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:59,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:59,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:59,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:59,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:59,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:59,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:59,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:59,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:59,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:59,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:59,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:59,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:59,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:59,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:59,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:59,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:59,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:59,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:59,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:59,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:59,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:59,726 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:59,762 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:59,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:59,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:59,763 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:59,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:59,764 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:59,764 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:59,765 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:59,765 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:59,765 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:59,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:59,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:59,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:59,771 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:59,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:59,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:59,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:59,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:59,824 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:59,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-1.c [2019-09-20 13:27:59,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b237ac/f4390bd9e7d5499990dfe02d3009cbb3/FLAG18ebdb226 [2019-09-20 13:28:00,522 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:00,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-1.c [2019-09-20 13:28:00,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b237ac/f4390bd9e7d5499990dfe02d3009cbb3/FLAG18ebdb226 [2019-09-20 13:28:00,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b237ac/f4390bd9e7d5499990dfe02d3009cbb3 [2019-09-20 13:28:00,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:00,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:00,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:00,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:00,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:00,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:00" (1/1) ... [2019-09-20 13:28:00,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6f752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:00, skipping insertion in model container [2019-09-20 13:28:00,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:00" (1/1) ... [2019-09-20 13:28:00,773 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:00,856 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:01,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,553 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:01,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,801 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:01,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01 WrapperNode [2019-09-20 13:28:01,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:01,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:01,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:01,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:01,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:01,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:01,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (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:28:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:02,551 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:03,360 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:03,361 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:03,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:03,383 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:03,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:03 BoogieIcfgContainer [2019-09-20 13:28:03,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:03,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:03,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:03,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:03,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:00" (1/3) ... [2019-09-20 13:28:03,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22123aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:03, skipping insertion in model container [2019-09-20 13:28:03,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (2/3) ... [2019-09-20 13:28:03,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22123aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:03, skipping insertion in model container [2019-09-20 13:28:03,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:03" (3/3) ... [2019-09-20 13:28:03,394 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-09-20 13:28:03,404 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:03,413 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:03,431 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:03,461 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:03,461 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:03,462 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:03,462 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:03,462 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:03,462 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:03,462 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:03,462 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2019-09-20 13:28:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:28:03,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,517 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] [2019-09-20 13:28:03,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2060539826, now seen corresponding path program 1 times [2019-09-20 13:28:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,969 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:28:03,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,997 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2019-09-20 13:28:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,441 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-09-20 13:28:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-20 13:28:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,457 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:28:04,457 INFO L226 Difference]: Without dead ends: 175 [2019-09-20 13:28:04,459 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:28:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-20 13:28:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-09-20 13:28:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 13:28:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2019-09-20 13:28:04,517 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 49 [2019-09-20 13:28:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,518 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2019-09-20 13:28:04,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2019-09-20 13:28:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:04,527 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,527 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] [2019-09-20 13:28:04,527 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1928544508, now seen corresponding path program 1 times [2019-09-20 13:28:04,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,757 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:28:04,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,761 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand 4 states. [2019-09-20 13:28:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,173 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-09-20 13:28:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,177 INFO L225 Difference]: With dead ends: 175 [2019-09-20 13:28:05,177 INFO L226 Difference]: Without dead ends: 175 [2019-09-20 13:28:05,178 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:28:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-20 13:28:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-09-20 13:28:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 13:28:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 243 transitions. [2019-09-20 13:28:05,203 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 243 transitions. Word has length 62 [2019-09-20 13:28:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,204 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 243 transitions. [2019-09-20 13:28:05,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 243 transitions. [2019-09-20 13:28:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:05,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,212 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] [2019-09-20 13:28:05,214 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -33363220, now seen corresponding path program 1 times [2019-09-20 13:28:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,386 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:28:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,389 INFO L87 Difference]: Start difference. First operand 158 states and 243 transitions. Second operand 4 states. [2019-09-20 13:28:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,694 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2019-09-20 13:28:05,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,696 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:28:05,697 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:28:05,697 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:28:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2019-09-20 13:28:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 13:28:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2019-09-20 13:28:05,708 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 63 [2019-09-20 13:28:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,708 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2019-09-20 13:28:05,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2019-09-20 13:28:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:05,710 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,710 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] [2019-09-20 13:28:05,711 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1853540224, now seen corresponding path program 1 times [2019-09-20 13:28:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,834 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:28:05,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:05,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,836 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand 5 states. [2019-09-20 13:28:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,373 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-09-20 13:28:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:06,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:28:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,375 INFO L225 Difference]: With dead ends: 179 [2019-09-20 13:28:06,376 INFO L226 Difference]: Without dead ends: 179 [2019-09-20 13:28:06,376 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:28:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-20 13:28:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-20 13:28:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 269 transitions. [2019-09-20 13:28:06,386 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 269 transitions. Word has length 63 [2019-09-20 13:28:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,386 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 269 transitions. [2019-09-20 13:28:06,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 269 transitions. [2019-09-20 13:28:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:06,388 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,389 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] [2019-09-20 13:28:06,389 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1258860232, now seen corresponding path program 1 times [2019-09-20 13:28:06,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,524 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:28:06,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,527 INFO L87 Difference]: Start difference. First operand 178 states and 269 transitions. Second operand 4 states. [2019-09-20 13:28:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,848 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-09-20 13:28:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,850 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:06,850 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:28:06,850 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:28:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:28:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2019-09-20 13:28:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions. [2019-09-20 13:28:06,856 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 63 [2019-09-20 13:28:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,856 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 268 transitions. [2019-09-20 13:28:06,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions. [2019-09-20 13:28:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:06,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,858 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] [2019-09-20 13:28:06,859 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1326420233, now seen corresponding path program 1 times [2019-09-20 13:28:06,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,926 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:28:06,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,928 INFO L87 Difference]: Start difference. First operand 178 states and 268 transitions. Second operand 4 states. [2019-09-20 13:28:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,191 INFO L93 Difference]: Finished difference Result 191 states and 283 transitions. [2019-09-20 13:28:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,193 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:28:07,193 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:28:07,194 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:28:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:28:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-20 13:28:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2019-09-20 13:28:07,200 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 63 [2019-09-20 13:28:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,201 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2019-09-20 13:28:07,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2019-09-20 13:28:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:07,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,202 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:28:07,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1044164865, now seen corresponding path program 1 times [2019-09-20 13:28:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,264 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:28:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,266 INFO L87 Difference]: Start difference. First operand 178 states and 267 transitions. Second operand 4 states. [2019-09-20 13:28:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,516 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2019-09-20 13:28:07,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,520 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:28:07,520 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:28:07,520 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:28:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:28:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-20 13:28:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 266 transitions. [2019-09-20 13:28:07,526 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 266 transitions. Word has length 64 [2019-09-20 13:28:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,526 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 266 transitions. [2019-09-20 13:28:07,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 266 transitions. [2019-09-20 13:28:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:07,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,528 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] [2019-09-20 13:28:07,528 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash 964284788, now seen corresponding path program 1 times [2019-09-20 13:28:07,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,606 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:28:07,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,608 INFO L87 Difference]: Start difference. First operand 178 states and 266 transitions. Second operand 4 states. [2019-09-20 13:28:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,873 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2019-09-20 13:28:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,875 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:28:07,875 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:28:07,876 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:28:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:28:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-20 13:28:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2019-09-20 13:28:07,882 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 65 [2019-09-20 13:28:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,883 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2019-09-20 13:28:07,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2019-09-20 13:28:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:07,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,884 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] [2019-09-20 13:28:07,885 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash -959059780, now seen corresponding path program 1 times [2019-09-20 13:28:07,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,944 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:28:07,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,946 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand 4 states. [2019-09-20 13:28:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,220 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2019-09-20 13:28:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,222 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:28:08,222 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:28:08,223 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:28:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:28:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-09-20 13:28:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-20 13:28:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2019-09-20 13:28:08,229 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 66 [2019-09-20 13:28:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,229 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2019-09-20 13:28:08,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2019-09-20 13:28:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:08,230 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,230 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] [2019-09-20 13:28:08,231 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1177157861, now seen corresponding path program 1 times [2019-09-20 13:28:08,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,296 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:28:08,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,298 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand 4 states. [2019-09-20 13:28:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,585 INFO L93 Difference]: Finished difference Result 220 states and 326 transitions. [2019-09-20 13:28:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,589 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:08,589 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:08,589 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:28:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2019-09-20 13:28:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-09-20 13:28:08,598 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 66 [2019-09-20 13:28:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,599 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-09-20 13:28:08,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-09-20 13:28:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:08,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,600 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] [2019-09-20 13:28:08,600 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash 99738575, now seen corresponding path program 1 times [2019-09-20 13:28:08,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,672 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:28:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,674 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 4 states. [2019-09-20 13:28:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,949 INFO L93 Difference]: Finished difference Result 203 states and 304 transitions. [2019-09-20 13:28:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,953 INFO L225 Difference]: With dead ends: 203 [2019-09-20 13:28:08,953 INFO L226 Difference]: Without dead ends: 203 [2019-09-20 13:28:08,953 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:28:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-20 13:28:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-09-20 13:28:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions. [2019-09-20 13:28:08,963 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 67 [2019-09-20 13:28:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,963 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 300 transitions. [2019-09-20 13:28:08,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions. [2019-09-20 13:28:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:08,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,965 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] [2019-09-20 13:28:08,965 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1071932073, now seen corresponding path program 1 times [2019-09-20 13:28:08,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,077 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:28:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,079 INFO L87 Difference]: Start difference. First operand 200 states and 300 transitions. Second operand 4 states. [2019-09-20 13:28:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,379 INFO L93 Difference]: Finished difference Result 220 states and 324 transitions. [2019-09-20 13:28:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,382 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:28:09,382 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:28:09,382 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:28:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:28:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2019-09-20 13:28:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2019-09-20 13:28:09,388 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 79 [2019-09-20 13:28:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,388 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2019-09-20 13:28:09,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2019-09-20 13:28:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:09,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,390 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] [2019-09-20 13:28:09,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -473678523, now seen corresponding path program 1 times [2019-09-20 13:28:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,444 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:28:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,446 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand 4 states. [2019-09-20 13:28:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,744 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-20 13:28:09,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,747 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:09,747 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:09,748 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:28:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2019-09-20 13:28:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-09-20 13:28:09,754 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 80 [2019-09-20 13:28:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,755 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2019-09-20 13:28:09,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2019-09-20 13:28:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:09,757 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,757 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] [2019-09-20 13:28:09,757 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash -541238524, now seen corresponding path program 1 times [2019-09-20 13:28:09,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,833 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:28:09,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,836 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand 4 states. [2019-09-20 13:28:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,187 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2019-09-20 13:28:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,191 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:10,191 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:10,191 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:28:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-20 13:28:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 297 transitions. [2019-09-20 13:28:10,198 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 297 transitions. Word has length 80 [2019-09-20 13:28:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,198 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 297 transitions. [2019-09-20 13:28:10,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 297 transitions. [2019-09-20 13:28:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:10,203 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,204 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] [2019-09-20 13:28:10,204 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash -385005932, now seen corresponding path program 1 times [2019-09-20 13:28:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,275 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:28:10,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,277 INFO L87 Difference]: Start difference. First operand 200 states and 297 transitions. Second operand 4 states. [2019-09-20 13:28:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,538 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-20 13:28:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,540 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:10,540 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:10,541 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:28:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-20 13:28:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2019-09-20 13:28:10,546 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 81 [2019-09-20 13:28:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,547 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2019-09-20 13:28:10,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2019-09-20 13:28:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:10,548 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,548 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] [2019-09-20 13:28:10,548 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash -390336959, now seen corresponding path program 1 times [2019-09-20 13:28:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,631 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:28:10,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,633 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand 4 states. [2019-09-20 13:28:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,923 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2019-09-20 13:28:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,925 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:10,925 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:10,926 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:28:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-20 13:28:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 295 transitions. [2019-09-20 13:28:10,932 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 295 transitions. Word has length 82 [2019-09-20 13:28:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,932 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 295 transitions. [2019-09-20 13:28:10,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 295 transitions. [2019-09-20 13:28:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:10,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,935 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] [2019-09-20 13:28:10,935 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2660977, now seen corresponding path program 1 times [2019-09-20 13:28:10,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,998 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:28:10,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,999 INFO L87 Difference]: Start difference. First operand 200 states and 295 transitions. Second operand 4 states. [2019-09-20 13:28:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,279 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2019-09-20 13:28:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,281 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:11,282 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:11,282 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:28:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-09-20 13:28:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-20 13:28:11,289 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 83 [2019-09-20 13:28:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,289 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-20 13:28:11,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-20 13:28:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:28:11,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,291 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] [2019-09-20 13:28:11,291 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -316669604, now seen corresponding path program 1 times [2019-09-20 13:28:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,387 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:28:11,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,389 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 4 states. [2019-09-20 13:28:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,703 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2019-09-20 13:28:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:28:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,705 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:28:11,705 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:28:11,706 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:28:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:28:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2019-09-20 13:28:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:28:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2019-09-20 13:28:11,711 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 84 [2019-09-20 13:28:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,711 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2019-09-20 13:28:11,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2019-09-20 13:28:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:11,713 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,713 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] [2019-09-20 13:28:11,713 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1342493364, now seen corresponding path program 1 times [2019-09-20 13:28:11,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,795 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:28:11,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,798 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand 4 states. [2019-09-20 13:28:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,261 INFO L93 Difference]: Finished difference Result 311 states and 464 transitions. [2019-09-20 13:28:12,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,265 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:12,265 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:12,266 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:28:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 241. [2019-09-20 13:28:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-20 13:28:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 366 transitions. [2019-09-20 13:28:12,277 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 366 transitions. Word has length 88 [2019-09-20 13:28:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,278 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 366 transitions. [2019-09-20 13:28:12,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 366 transitions. [2019-09-20 13:28:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:12,280 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,280 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] [2019-09-20 13:28:12,281 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1766140086, now seen corresponding path program 1 times [2019-09-20 13:28:12,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,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:28:12,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,434 INFO L87 Difference]: Start difference. First operand 241 states and 366 transitions. Second operand 4 states. [2019-09-20 13:28:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,865 INFO L93 Difference]: Finished difference Result 290 states and 439 transitions. [2019-09-20 13:28:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,869 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:12,869 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:12,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:28:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2019-09-20 13:28:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2019-09-20 13:28:12,882 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 88 [2019-09-20 13:28:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,883 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2019-09-20 13:28:12,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2019-09-20 13:28:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:12,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,886 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:28:12,886 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -190796336, now seen corresponding path program 1 times [2019-09-20 13:28:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,003 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:28:13,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,005 INFO L87 Difference]: Start difference. First operand 265 states and 407 transitions. Second operand 4 states. [2019-09-20 13:28:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,406 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2019-09-20 13:28:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,409 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:13,409 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:13,410 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:28:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 266. [2019-09-20 13:28:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 408 transitions. [2019-09-20 13:28:13,417 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 408 transitions. Word has length 89 [2019-09-20 13:28:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,417 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 408 transitions. [2019-09-20 13:28:13,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 408 transitions. [2019-09-20 13:28:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:13,419 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,419 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] [2019-09-20 13:28:13,419 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash -278320546, now seen corresponding path program 1 times [2019-09-20 13:28:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,517 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:28:13,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,519 INFO L87 Difference]: Start difference. First operand 266 states and 408 transitions. Second operand 4 states. [2019-09-20 13:28:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,938 INFO L93 Difference]: Finished difference Result 327 states and 492 transitions. [2019-09-20 13:28:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,941 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:13,941 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:13,942 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 266. [2019-09-20 13:28:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 407 transitions. [2019-09-20 13:28:13,949 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 407 transitions. Word has length 101 [2019-09-20 13:28:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,949 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 407 transitions. [2019-09-20 13:28:13,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 407 transitions. [2019-09-20 13:28:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:13,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,951 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] [2019-09-20 13:28:13,952 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 597698460, now seen corresponding path program 1 times [2019-09-20 13:28:13,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,015 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:28:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,017 INFO L87 Difference]: Start difference. First operand 266 states and 407 transitions. Second operand 4 states. [2019-09-20 13:28:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,357 INFO L93 Difference]: Finished difference Result 291 states and 438 transitions. [2019-09-20 13:28:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,360 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:28:14,360 INFO L226 Difference]: Without dead ends: 291 [2019-09-20 13:28:14,361 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:28:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-20 13:28:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2019-09-20 13:28:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 406 transitions. [2019-09-20 13:28:14,368 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 406 transitions. Word has length 101 [2019-09-20 13:28:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,368 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 406 transitions. [2019-09-20 13:28:14,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 406 transitions. [2019-09-20 13:28:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:14,369 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,370 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] [2019-09-20 13:28:14,370 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1641524962, now seen corresponding path program 1 times [2019-09-20 13:28:14,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,440 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:28:14,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,441 INFO L87 Difference]: Start difference. First operand 266 states and 406 transitions. Second operand 4 states. [2019-09-20 13:28:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,811 INFO L93 Difference]: Finished difference Result 326 states and 489 transitions. [2019-09-20 13:28:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,814 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:14,814 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:14,814 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:28:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-09-20 13:28:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 405 transitions. [2019-09-20 13:28:14,821 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 405 transitions. Word has length 102 [2019-09-20 13:28:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,822 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 405 transitions. [2019-09-20 13:28:14,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 405 transitions. [2019-09-20 13:28:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:14,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,824 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] [2019-09-20 13:28:14,824 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1709084963, now seen corresponding path program 1 times [2019-09-20 13:28:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,901 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:28:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,903 INFO L87 Difference]: Start difference. First operand 266 states and 405 transitions. Second operand 4 states. [2019-09-20 13:28:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,310 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-09-20 13:28:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,312 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:15,312 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:15,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:28:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-20 13:28:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 404 transitions. [2019-09-20 13:28:15,319 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 404 transitions. Word has length 102 [2019-09-20 13:28:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,319 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 404 transitions. [2019-09-20 13:28:15,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2019-09-20 13:28:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:15,321 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,321 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] [2019-09-20 13:28:15,321 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -254739552, now seen corresponding path program 1 times [2019-09-20 13:28:15,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,394 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:28:15,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,396 INFO L87 Difference]: Start difference. First operand 266 states and 404 transitions. Second operand 4 states. [2019-09-20 13:28:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,729 INFO L93 Difference]: Finished difference Result 290 states and 434 transitions. [2019-09-20 13:28:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,733 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:15,733 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:15,733 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:28:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 266. [2019-09-20 13:28:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 403 transitions. [2019-09-20 13:28:15,745 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 403 transitions. Word has length 102 [2019-09-20 13:28:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,745 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 403 transitions. [2019-09-20 13:28:15,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2019-09-20 13:28:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:15,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,747 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] [2019-09-20 13:28:15,747 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -322299553, now seen corresponding path program 1 times [2019-09-20 13:28:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,842 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:28:15,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,844 INFO L87 Difference]: Start difference. First operand 266 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,197 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2019-09-20 13:28:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,199 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:16,200 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:16,200 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:28:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-20 13:28:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 402 transitions. [2019-09-20 13:28:16,206 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 402 transitions. Word has length 102 [2019-09-20 13:28:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,207 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 402 transitions. [2019-09-20 13:28:16,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 402 transitions. [2019-09-20 13:28:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:16,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,208 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] [2019-09-20 13:28:16,209 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2066460123, now seen corresponding path program 1 times [2019-09-20 13:28:16,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,267 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:28:16,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,268 INFO L87 Difference]: Start difference. First operand 266 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,657 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-09-20 13:28:16,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,660 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:16,661 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:16,661 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:28:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-20 13:28:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2019-09-20 13:28:16,671 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 103 [2019-09-20 13:28:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,671 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2019-09-20 13:28:16,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2019-09-20 13:28:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:16,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,673 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] [2019-09-20 13:28:16,673 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2107134873, now seen corresponding path program 1 times [2019-09-20 13:28:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,737 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:28:16,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,740 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,067 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2019-09-20 13:28:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,070 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:17,070 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:17,070 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:28:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-20 13:28:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2019-09-20 13:28:17,077 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 103 [2019-09-20 13:28:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,077 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2019-09-20 13:28:17,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2019-09-20 13:28:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:17,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,079 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] [2019-09-20 13:28:17,079 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1704300582, now seen corresponding path program 1 times [2019-09-20 13:28:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,137 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:28:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,139 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,626 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-09-20 13:28:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,629 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:17,630 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:17,630 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:28:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-20 13:28:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2019-09-20 13:28:17,640 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 104 [2019-09-20 13:28:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,641 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2019-09-20 13:28:17,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2019-09-20 13:28:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:17,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,643 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,644 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -443383332, now seen corresponding path program 1 times [2019-09-20 13:28:17,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,722 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:28:17,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,724 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,013 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2019-09-20 13:28:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,015 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:18,015 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:18,015 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:28:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-20 13:28:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 398 transitions. [2019-09-20 13:28:18,021 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 398 transitions. Word has length 104 [2019-09-20 13:28:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,021 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 398 transitions. [2019-09-20 13:28:18,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2019-09-20 13:28:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:18,023 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,023 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] [2019-09-20 13:28:18,023 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2080827626, now seen corresponding path program 1 times [2019-09-20 13:28:18,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,120 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:28:18,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,122 INFO L87 Difference]: Start difference. First operand 266 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,502 INFO L93 Difference]: Finished difference Result 324 states and 479 transitions. [2019-09-20 13:28:18,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,504 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:18,505 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:18,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:28:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2019-09-20 13:28:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 397 transitions. [2019-09-20 13:28:18,511 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 397 transitions. Word has length 105 [2019-09-20 13:28:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,511 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 397 transitions. [2019-09-20 13:28:18,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 397 transitions. [2019-09-20 13:28:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:18,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,513 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] [2019-09-20 13:28:18,513 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1647098540, now seen corresponding path program 1 times [2019-09-20 13:28:18,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,577 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:28:18,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,582 INFO L87 Difference]: Start difference. First operand 266 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,918 INFO L93 Difference]: Finished difference Result 288 states and 425 transitions. [2019-09-20 13:28:18,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,921 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:18,921 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:18,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-09-20 13:28:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2019-09-20 13:28:18,928 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 105 [2019-09-20 13:28:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,928 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2019-09-20 13:28:18,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2019-09-20 13:28:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:18,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,930 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] [2019-09-20 13:28:18,930 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -315326283, now seen corresponding path program 1 times [2019-09-20 13:28:18,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,992 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:28:18,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,993 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,415 INFO L93 Difference]: Finished difference Result 314 states and 465 transitions. [2019-09-20 13:28:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,418 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:19,418 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:19,418 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:28:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2019-09-20 13:28:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 395 transitions. [2019-09-20 13:28:19,424 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 395 transitions. Word has length 106 [2019-09-20 13:28:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,425 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 395 transitions. [2019-09-20 13:28:19,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 395 transitions. [2019-09-20 13:28:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:19,427 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,427 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] [2019-09-20 13:28:19,427 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 245373495, now seen corresponding path program 1 times [2019-09-20 13:28:19,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,489 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:28:19,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,490 INFO L87 Difference]: Start difference. First operand 266 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,776 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2019-09-20 13:28:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,779 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:28:19,779 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:28:19,780 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:28:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:28:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2019-09-20 13:28:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 394 transitions. [2019-09-20 13:28:19,788 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 394 transitions. Word has length 106 [2019-09-20 13:28:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,788 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 394 transitions. [2019-09-20 13:28:19,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 394 transitions. [2019-09-20 13:28:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:19,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,790 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] [2019-09-20 13:28:19,790 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash -807858597, now seen corresponding path program 1 times [2019-09-20 13:28:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,893 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:28:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,898 INFO L87 Difference]: Start difference. First operand 266 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,434 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2019-09-20 13:28:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:28:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,437 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:20,437 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:20,437 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:28:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2019-09-20 13:28:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-20 13:28:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 393 transitions. [2019-09-20 13:28:20,443 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 393 transitions. Word has length 110 [2019-09-20 13:28:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,444 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 393 transitions. [2019-09-20 13:28:20,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 393 transitions. [2019-09-20 13:28:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:20,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,446 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] [2019-09-20 13:28:20,446 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1225255203, now seen corresponding path program 1 times [2019-09-20 13:28:20,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:28:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:20,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,527 INFO L87 Difference]: Start difference. First operand 266 states and 393 transitions. Second operand 3 states. [2019-09-20 13:28:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,597 INFO L93 Difference]: Finished difference Result 505 states and 744 transitions. [2019-09-20 13:28:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-20 13:28:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,600 INFO L225 Difference]: With dead ends: 505 [2019-09-20 13:28:20,600 INFO L226 Difference]: Without dead ends: 505 [2019-09-20 13:28:20,601 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:28:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-20 13:28:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-20 13:28:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-20 13:28:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 744 transitions. [2019-09-20 13:28:20,611 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 744 transitions. Word has length 110 [2019-09-20 13:28:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,613 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 744 transitions. [2019-09-20 13:28:20,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 744 transitions. [2019-09-20 13:28:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:28:20,615 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,615 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,616 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -875033401, now seen corresponding path program 1 times [2019-09-20 13:28:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,675 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:28:20,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:20,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:20,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:20,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:20,676 INFO L87 Difference]: Start difference. First operand 505 states and 744 transitions. Second operand 3 states. [2019-09-20 13:28:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,745 INFO L93 Difference]: Finished difference Result 744 states and 1096 transitions. [2019-09-20 13:28:20,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:20,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:28:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,749 INFO L225 Difference]: With dead ends: 744 [2019-09-20 13:28:20,749 INFO L226 Difference]: Without dead ends: 744 [2019-09-20 13:28:20,750 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:28:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-20 13:28:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-20 13:28:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-20 13:28:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1096 transitions. [2019-09-20 13:28:20,763 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1096 transitions. Word has length 112 [2019-09-20 13:28:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,764 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1096 transitions. [2019-09-20 13:28:20,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1096 transitions. [2019-09-20 13:28:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:28:20,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,767 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,767 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash -355360796, now seen corresponding path program 1 times [2019-09-20 13:28:20,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:20,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,857 INFO L87 Difference]: Start difference. First operand 744 states and 1096 transitions. Second operand 4 states. [2019-09-20 13:28:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,225 INFO L93 Difference]: Finished difference Result 933 states and 1387 transitions. [2019-09-20 13:28:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:28:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,230 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:21,230 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:21,230 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:28:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 828. [2019-09-20 13:28:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1243 transitions. [2019-09-20 13:28:21,246 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1243 transitions. Word has length 141 [2019-09-20 13:28:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,247 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1243 transitions. [2019-09-20 13:28:21,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1243 transitions. [2019-09-20 13:28:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:28:21,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,250 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,250 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash 874990382, now seen corresponding path program 1 times [2019-09-20 13:28:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,329 INFO L87 Difference]: Start difference. First operand 828 states and 1243 transitions. Second operand 4 states. [2019-09-20 13:28:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,675 INFO L93 Difference]: Finished difference Result 933 states and 1384 transitions. [2019-09-20 13:28:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:28:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,681 INFO L225 Difference]: With dead ends: 933 [2019-09-20 13:28:21,682 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 13:28:21,682 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:28:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 13:28:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 828. [2019-09-20 13:28:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1240 transitions. [2019-09-20 13:28:21,698 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1240 transitions. Word has length 154 [2019-09-20 13:28:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,698 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1240 transitions. [2019-09-20 13:28:21,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1240 transitions. [2019-09-20 13:28:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:21,701 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,701 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,701 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash -248624562, now seen corresponding path program 1 times [2019-09-20 13:28:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:21,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,780 INFO L87 Difference]: Start difference. First operand 828 states and 1240 transitions. Second operand 4 states. [2019-09-20 13:28:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,202 INFO L93 Difference]: Finished difference Result 930 states and 1378 transitions. [2019-09-20 13:28:22,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,207 INFO L225 Difference]: With dead ends: 930 [2019-09-20 13:28:22,207 INFO L226 Difference]: Without dead ends: 930 [2019-09-20 13:28:22,208 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:28:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-09-20 13:28:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 828. [2019-09-20 13:28:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1237 transitions. [2019-09-20 13:28:22,225 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1237 transitions. Word has length 155 [2019-09-20 13:28:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,226 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1237 transitions. [2019-09-20 13:28:22,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1237 transitions. [2019-09-20 13:28:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:22,229 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,229 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:22,229 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash -316184563, now seen corresponding path program 1 times [2019-09-20 13:28:22,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:22,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,318 INFO L87 Difference]: Start difference. First operand 828 states and 1237 transitions. Second operand 4 states. [2019-09-20 13:28:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,686 INFO L93 Difference]: Finished difference Result 924 states and 1369 transitions. [2019-09-20 13:28:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,691 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:22,692 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:22,692 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:28:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-20 13:28:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1234 transitions. [2019-09-20 13:28:22,707 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1234 transitions. Word has length 155 [2019-09-20 13:28:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,708 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1234 transitions. [2019-09-20 13:28:22,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1234 transitions. [2019-09-20 13:28:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:22,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,712 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:22,712 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1998267733, now seen corresponding path program 1 times [2019-09-20 13:28:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:22,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,820 INFO L87 Difference]: Start difference. First operand 828 states and 1234 transitions. Second operand 4 states. [2019-09-20 13:28:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,147 INFO L93 Difference]: Finished difference Result 924 states and 1366 transitions. [2019-09-20 13:28:23,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,153 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:23,153 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:23,153 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:28:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-20 13:28:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1231 transitions. [2019-09-20 13:28:23,168 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1231 transitions. Word has length 156 [2019-09-20 13:28:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,168 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1231 transitions. [2019-09-20 13:28:23,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1231 transitions. [2019-09-20 13:28:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:23,171 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,171 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:23,172 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1138154762, now seen corresponding path program 1 times [2019-09-20 13:28:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:23,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,260 INFO L87 Difference]: Start difference. First operand 828 states and 1231 transitions. Second operand 4 states. [2019-09-20 13:28:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,597 INFO L93 Difference]: Finished difference Result 924 states and 1363 transitions. [2019-09-20 13:28:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,601 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:23,601 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:23,602 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:28:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-20 13:28:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1228 transitions. [2019-09-20 13:28:23,616 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1228 transitions. Word has length 157 [2019-09-20 13:28:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,616 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1228 transitions. [2019-09-20 13:28:23,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1228 transitions. [2019-09-20 13:28:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:23,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,619 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:23,619 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 135942118, now seen corresponding path program 1 times [2019-09-20 13:28:23,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:23,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,719 INFO L87 Difference]: Start difference. First operand 828 states and 1228 transitions. Second operand 4 states. [2019-09-20 13:28:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,074 INFO L93 Difference]: Finished difference Result 924 states and 1360 transitions. [2019-09-20 13:28:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,080 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:28:24,080 INFO L226 Difference]: Without dead ends: 924 [2019-09-20 13:28:24,080 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:28:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-20 13:28:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 828. [2019-09-20 13:28:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1225 transitions. [2019-09-20 13:28:24,094 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1225 transitions. Word has length 158 [2019-09-20 13:28:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,094 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1225 transitions. [2019-09-20 13:28:24,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1225 transitions. [2019-09-20 13:28:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:24,097 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,097 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,097 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -314940955, now seen corresponding path program 1 times [2019-09-20 13:28:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:24,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,188 INFO L87 Difference]: Start difference. First operand 828 states and 1225 transitions. Second operand 4 states. [2019-09-20 13:28:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,589 INFO L93 Difference]: Finished difference Result 894 states and 1321 transitions. [2019-09-20 13:28:24,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,594 INFO L225 Difference]: With dead ends: 894 [2019-09-20 13:28:24,594 INFO L226 Difference]: Without dead ends: 894 [2019-09-20 13:28:24,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-20 13:28:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 828. [2019-09-20 13:28:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1222 transitions. [2019-09-20 13:28:24,607 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1222 transitions. Word has length 159 [2019-09-20 13:28:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,608 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1222 transitions. [2019-09-20 13:28:24,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1222 transitions. [2019-09-20 13:28:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:28:24,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,610 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,611 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1431644277, now seen corresponding path program 1 times [2019-09-20 13:28:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:24,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,690 INFO L87 Difference]: Start difference. First operand 828 states and 1222 transitions. Second operand 4 states. [2019-09-20 13:28:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,009 INFO L93 Difference]: Finished difference Result 894 states and 1318 transitions. [2019-09-20 13:28:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-20 13:28:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,015 INFO L225 Difference]: With dead ends: 894 [2019-09-20 13:28:25,015 INFO L226 Difference]: Without dead ends: 894 [2019-09-20 13:28:25,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:28:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-20 13:28:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 828. [2019-09-20 13:28:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1219 transitions. [2019-09-20 13:28:25,029 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1219 transitions. Word has length 163 [2019-09-20 13:28:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,029 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1219 transitions. [2019-09-20 13:28:25,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1219 transitions. [2019-09-20 13:28:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-20 13:28:25,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,032 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,032 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash -172312564, now seen corresponding path program 1 times [2019-09-20 13:28:25,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,118 INFO L87 Difference]: Start difference. First operand 828 states and 1219 transitions. Second operand 4 states. [2019-09-20 13:28:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,429 INFO L93 Difference]: Finished difference Result 879 states and 1294 transitions. [2019-09-20 13:28:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-20 13:28:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,437 INFO L225 Difference]: With dead ends: 879 [2019-09-20 13:28:25,437 INFO L226 Difference]: Without dead ends: 879 [2019-09-20 13:28:25,438 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:28:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-20 13:28:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 828. [2019-09-20 13:28:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-20 13:28:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1216 transitions. [2019-09-20 13:28:25,454 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1216 transitions. Word has length 164 [2019-09-20 13:28:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,454 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1216 transitions. [2019-09-20 13:28:25,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1216 transitions. [2019-09-20 13:28:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-20 13:28:25,457 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,457 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,457 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1392588597, now seen corresponding path program 1 times [2019-09-20 13:28:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:25,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,549 INFO L87 Difference]: Start difference. First operand 828 states and 1216 transitions. Second operand 3 states. [2019-09-20 13:28:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,638 INFO L93 Difference]: Finished difference Result 1095 states and 1609 transitions. [2019-09-20 13:28:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:25,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-20 13:28:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,644 INFO L225 Difference]: With dead ends: 1095 [2019-09-20 13:28:25,644 INFO L226 Difference]: Without dead ends: 1095 [2019-09-20 13:28:25,645 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:28:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-09-20 13:28:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2019-09-20 13:28:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-20 13:28:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1609 transitions. [2019-09-20 13:28:25,662 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1609 transitions. Word has length 166 [2019-09-20 13:28:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,663 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1609 transitions. [2019-09-20 13:28:25,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1609 transitions. [2019-09-20 13:28:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-20 13:28:25,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,667 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,667 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 226717446, now seen corresponding path program 1 times [2019-09-20 13:28:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-20 13:28:25,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,758 INFO L87 Difference]: Start difference. First operand 1095 states and 1609 transitions. Second operand 3 states. [2019-09-20 13:28:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,829 INFO L93 Difference]: Finished difference Result 1362 states and 2003 transitions. [2019-09-20 13:28:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:25,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-20 13:28:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,836 INFO L225 Difference]: With dead ends: 1362 [2019-09-20 13:28:25,836 INFO L226 Difference]: Without dead ends: 1362 [2019-09-20 13:28:25,836 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:28:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2019-09-20 13:28:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2019-09-20 13:28:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-20 13:28:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2003 transitions. [2019-09-20 13:28:25,857 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2003 transitions. Word has length 172 [2019-09-20 13:28:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,857 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2003 transitions. [2019-09-20 13:28:25,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2003 transitions. [2019-09-20 13:28:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-20 13:28:25,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,861 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,862 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2083706138, now seen corresponding path program 1 times [2019-09-20 13:28:25,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,964 INFO L87 Difference]: Start difference. First operand 1362 states and 2003 transitions. Second operand 3 states. [2019-09-20 13:28:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,034 INFO L93 Difference]: Finished difference Result 1629 states and 2398 transitions. [2019-09-20 13:28:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:26,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-20 13:28:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,042 INFO L225 Difference]: With dead ends: 1629 [2019-09-20 13:28:26,042 INFO L226 Difference]: Without dead ends: 1629 [2019-09-20 13:28:26,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-20 13:28:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2019-09-20 13:28:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-09-20 13:28:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2398 transitions. [2019-09-20 13:28:26,066 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2398 transitions. Word has length 204 [2019-09-20 13:28:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,066 INFO L475 AbstractCegarLoop]: Abstraction has 1629 states and 2398 transitions. [2019-09-20 13:28:26,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2398 transitions. [2019-09-20 13:28:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-20 13:28:26,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,072 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,073 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1039409924, now seen corresponding path program 1 times [2019-09-20 13:28:26,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-20 13:28:26,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:26,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:26,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:26,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:26,173 INFO L87 Difference]: Start difference. First operand 1629 states and 2398 transitions. Second operand 3 states. [2019-09-20 13:28:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,252 INFO L93 Difference]: Finished difference Result 1896 states and 2794 transitions. [2019-09-20 13:28:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:26,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-20 13:28:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,261 INFO L225 Difference]: With dead ends: 1896 [2019-09-20 13:28:26,261 INFO L226 Difference]: Without dead ends: 1896 [2019-09-20 13:28:26,261 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:28:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-09-20 13:28:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-09-20 13:28:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-20 13:28:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2794 transitions. [2019-09-20 13:28:26,289 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2794 transitions. Word has length 206 [2019-09-20 13:28:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,289 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2794 transitions. [2019-09-20 13:28:26,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2794 transitions. [2019-09-20 13:28:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-20 13:28:26,294 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,294 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,295 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -258662525, now seen corresponding path program 1 times [2019-09-20 13:28:26,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-20 13:28:26,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:26,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:26,416 INFO L87 Difference]: Start difference. First operand 1896 states and 2794 transitions. Second operand 3 states. [2019-09-20 13:28:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,488 INFO L93 Difference]: Finished difference Result 2163 states and 3191 transitions. [2019-09-20 13:28:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:26,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-20 13:28:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,495 INFO L225 Difference]: With dead ends: 2163 [2019-09-20 13:28:26,496 INFO L226 Difference]: Without dead ends: 2163 [2019-09-20 13:28:26,496 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:28:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-09-20 13:28:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2163. [2019-09-20 13:28:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-09-20 13:28:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3191 transitions. [2019-09-20 13:28:26,568 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3191 transitions. Word has length 239 [2019-09-20 13:28:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,569 INFO L475 AbstractCegarLoop]: Abstraction has 2163 states and 3191 transitions. [2019-09-20 13:28:26,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3191 transitions. [2019-09-20 13:28:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-20 13:28:26,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,575 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,575 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -445467436, now seen corresponding path program 1 times [2019-09-20 13:28:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-20 13:28:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:26,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:26,717 INFO L87 Difference]: Start difference. First operand 2163 states and 3191 transitions. Second operand 3 states. [2019-09-20 13:28:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,787 INFO L93 Difference]: Finished difference Result 2424 states and 3572 transitions. [2019-09-20 13:28:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:26,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-20 13:28:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,793 INFO L225 Difference]: With dead ends: 2424 [2019-09-20 13:28:26,793 INFO L226 Difference]: Without dead ends: 2424 [2019-09-20 13:28:26,794 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:28:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-09-20 13:28:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2019-09-20 13:28:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-09-20 13:28:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3572 transitions. [2019-09-20 13:28:26,823 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3572 transitions. Word has length 274 [2019-09-20 13:28:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,824 INFO L475 AbstractCegarLoop]: Abstraction has 2424 states and 3572 transitions. [2019-09-20 13:28:26,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3572 transitions. [2019-09-20 13:28:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-20 13:28:26,829 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,830 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,830 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1783136205, now seen corresponding path program 1 times [2019-09-20 13:28:26,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-20 13:28:26,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:26,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:26,988 INFO L87 Difference]: Start difference. First operand 2424 states and 3572 transitions. Second operand 3 states. [2019-09-20 13:28:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,061 INFO L93 Difference]: Finished difference Result 2691 states and 3971 transitions. [2019-09-20 13:28:27,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:27,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-20 13:28:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,068 INFO L225 Difference]: With dead ends: 2691 [2019-09-20 13:28:27,068 INFO L226 Difference]: Without dead ends: 2691 [2019-09-20 13:28:27,068 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:28:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2019-09-20 13:28:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2691. [2019-09-20 13:28:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-09-20 13:28:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3971 transitions. [2019-09-20 13:28:27,100 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3971 transitions. Word has length 313 [2019-09-20 13:28:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,101 INFO L475 AbstractCegarLoop]: Abstraction has 2691 states and 3971 transitions. [2019-09-20 13:28:27,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3971 transitions. [2019-09-20 13:28:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-20 13:28:27,107 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,108 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,108 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 855948233, now seen corresponding path program 1 times [2019-09-20 13:28:27,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-20 13:28:27,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:27,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:27,355 INFO L87 Difference]: Start difference. First operand 2691 states and 3971 transitions. Second operand 3 states. [2019-09-20 13:28:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,440 INFO L93 Difference]: Finished difference Result 2958 states and 4371 transitions. [2019-09-20 13:28:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:27,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-09-20 13:28:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,449 INFO L225 Difference]: With dead ends: 2958 [2019-09-20 13:28:27,449 INFO L226 Difference]: Without dead ends: 2958 [2019-09-20 13:28:27,449 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:28:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-09-20 13:28:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-09-20 13:28:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-09-20 13:28:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4371 transitions. [2019-09-20 13:28:27,498 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4371 transitions. Word has length 354 [2019-09-20 13:28:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,498 INFO L475 AbstractCegarLoop]: Abstraction has 2958 states and 4371 transitions. [2019-09-20 13:28:27,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4371 transitions. [2019-09-20 13:28:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-20 13:28:27,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,506 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,507 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 827999181, now seen corresponding path program 1 times [2019-09-20 13:28:27,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-20 13:28:27,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:27,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:27,769 INFO L87 Difference]: Start difference. First operand 2958 states and 4371 transitions. Second operand 3 states. [2019-09-20 13:28:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,845 INFO L93 Difference]: Finished difference Result 3220 states and 4753 transitions. [2019-09-20 13:28:27,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:27,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-20 13:28:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,851 INFO L225 Difference]: With dead ends: 3220 [2019-09-20 13:28:27,851 INFO L226 Difference]: Without dead ends: 3220 [2019-09-20 13:28:27,852 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:28:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2019-09-20 13:28:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3220. [2019-09-20 13:28:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2019-09-20 13:28:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4753 transitions. [2019-09-20 13:28:27,890 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4753 transitions. Word has length 397 [2019-09-20 13:28:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,890 INFO L475 AbstractCegarLoop]: Abstraction has 3220 states and 4753 transitions. [2019-09-20 13:28:27,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4753 transitions. [2019-09-20 13:28:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-20 13:28:27,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,899 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,899 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2140402930, now seen corresponding path program 1 times [2019-09-20 13:28:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-20 13:28:28,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:28,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:28,270 INFO L87 Difference]: Start difference. First operand 3220 states and 4753 transitions. Second operand 3 states. [2019-09-20 13:28:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,383 INFO L93 Difference]: Finished difference Result 3487 states and 5155 transitions. [2019-09-20 13:28:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:28,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-09-20 13:28:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,394 INFO L225 Difference]: With dead ends: 3487 [2019-09-20 13:28:28,394 INFO L226 Difference]: Without dead ends: 3487 [2019-09-20 13:28:28,395 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:28:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2019-09-20 13:28:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2019-09-20 13:28:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3487 states. [2019-09-20 13:28:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 5155 transitions. [2019-09-20 13:28:28,452 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 5155 transitions. Word has length 437 [2019-09-20 13:28:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,453 INFO L475 AbstractCegarLoop]: Abstraction has 3487 states and 5155 transitions. [2019-09-20 13:28:28,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 5155 transitions. [2019-09-20 13:28:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-20 13:28:28,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,466 INFO L407 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:28,466 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1282909427, now seen corresponding path program 1 times [2019-09-20 13:28:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-20 13:28:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:28,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:28,885 INFO L87 Difference]: Start difference. First operand 3487 states and 5155 transitions. Second operand 3 states. [2019-09-20 13:28:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,968 INFO L93 Difference]: Finished difference Result 3754 states and 5558 transitions. [2019-09-20 13:28:28,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:28,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-20 13:28:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,976 INFO L225 Difference]: With dead ends: 3754 [2019-09-20 13:28:28,976 INFO L226 Difference]: Without dead ends: 3754 [2019-09-20 13:28:28,976 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:28:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-09-20 13:28:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3754. [2019-09-20 13:28:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2019-09-20 13:28:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 5558 transitions. [2019-09-20 13:28:29,020 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 5558 transitions. Word has length 479 [2019-09-20 13:28:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,020 INFO L475 AbstractCegarLoop]: Abstraction has 3754 states and 5558 transitions. [2019-09-20 13:28:29,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 5558 transitions. [2019-09-20 13:28:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-20 13:28:29,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,029 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,030 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1281015599, now seen corresponding path program 1 times [2019-09-20 13:28:29,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-20 13:28:29,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,338 INFO L87 Difference]: Start difference. First operand 3754 states and 5558 transitions. Second operand 4 states. [2019-09-20 13:28:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,871 INFO L93 Difference]: Finished difference Result 5247 states and 7815 transitions. [2019-09-20 13:28:29,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 523 [2019-09-20 13:28:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,881 INFO L225 Difference]: With dead ends: 5247 [2019-09-20 13:28:29,881 INFO L226 Difference]: Without dead ends: 5247 [2019-09-20 13:28:29,882 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:28:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5247 states. [2019-09-20 13:28:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5247 to 4328. [2019-09-20 13:28:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4328 states. [2019-09-20 13:28:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 6608 transitions. [2019-09-20 13:28:29,938 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 6608 transitions. Word has length 523 [2019-09-20 13:28:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,939 INFO L475 AbstractCegarLoop]: Abstraction has 4328 states and 6608 transitions. [2019-09-20 13:28:29,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 6608 transitions. [2019-09-20 13:28:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-20 13:28:29,950 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,950 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,950 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1530470707, now seen corresponding path program 1 times [2019-09-20 13:28:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1409 proven. 81 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2019-09-20 13:28:30,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:28:30,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:28:30,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2019-09-20 13:28:30,705 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [558], [561], [569], [574], [576], [578], [583], [586], [588], [591], [599], [604], [606], [609], [611], [614], [622], [625], [629], [650], [684], [686], [698], [701], [702], [714], [722], [723], [724] [2019-09-20 13:28:30,802 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:28:30,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)