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.08.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:23,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:23,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:23,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:23,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:23,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:23,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:23,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:23,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:23,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:23,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:23,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:23,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:23,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:23,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:23,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:23,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:23,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:23,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:23,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:23,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:23,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:23,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:23,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:23,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:23,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:23,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:23,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:23,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:23,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:23,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:23,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:23,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:23,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:23,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:23,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:23,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:23,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:23,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:23,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:23,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:23,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:05:23,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:23,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:23,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:23,955 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:23,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:23,956 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:23,956 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:23,956 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:23,957 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:23,957 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:23,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:23,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:23,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:23,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:23,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:23,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:23,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:23,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:23,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:23,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:23,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:23,962 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:23,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:23,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:23,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:23,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:23,963 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:23,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:23,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:23,964 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:24,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:24,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:24,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:24,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:24,035 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:24,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-2.c [2019-09-16 17:05:24,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837e8ce3a/e92a55fa8162410aa849a2e4ac607e9b/FLAGe47cd45a2 [2019-09-16 17:05:24,687 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:24,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-2.c [2019-09-16 17:05:24,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837e8ce3a/e92a55fa8162410aa849a2e4ac607e9b/FLAGe47cd45a2 [2019-09-16 17:05:24,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837e8ce3a/e92a55fa8162410aa849a2e4ac607e9b [2019-09-16 17:05:24,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:24,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:24,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:24,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:24,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:24,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:24" (1/1) ... [2019-09-16 17:05:24,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f2e4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:24, skipping insertion in model container [2019-09-16 17:05:24,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:24" (1/1) ... [2019-09-16 17:05:24,976 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:25,050 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:25,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:25,610 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:25,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:25,850 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:25,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25 WrapperNode [2019-09-16 17:05:25,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:25,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:25,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:25,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:25,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:25,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:25,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:25,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:25,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:26,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:26,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... [2019-09-16 17:05:26,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:26,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:26,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:26,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:26,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:26,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:26,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:26,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:26,146 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:26,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:26,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:26,884 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:27,675 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:27,675 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:27,702 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:27,702 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:27,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:27 BoogieIcfgContainer [2019-09-16 17:05:27,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:27,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:27,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:27,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:27,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:24" (1/3) ... [2019-09-16 17:05:27,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698e935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:27, skipping insertion in model container [2019-09-16 17:05:27,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:25" (2/3) ... [2019-09-16 17:05:27,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698e935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:27, skipping insertion in model container [2019-09-16 17:05:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:27" (3/3) ... [2019-09-16 17:05:27,713 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2019-09-16 17:05:27,724 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:27,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:27,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:27,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:27,789 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:27,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:27,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:27,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:27,789 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:27,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:27,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-16 17:05:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 17:05:27,830 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,831 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] [2019-09-16 17:05:27,833 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1945619324, now seen corresponding path program 1 times [2019-09-16 17:05:27,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,290 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-16 17:05:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,754 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-16 17:05:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-16 17:05:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,771 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:05:28,771 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:28,773 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-16 17:05:28,837 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 48 [2019-09-16 17:05:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,838 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-16 17:05:28,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-16 17:05:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-16 17:05:28,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,844 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] [2019-09-16 17:05:28,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1332783137, now seen corresponding path program 1 times [2019-09-16 17:05:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:29,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,073 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-16 17:05:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,480 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-16 17:05:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-16 17:05:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,483 INFO L225 Difference]: With dead ends: 169 [2019-09-16 17:05:29,483 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:29,484 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-16 17:05:29,495 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 61 [2019-09-16 17:05:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,496 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-16 17:05:29,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-16 17:05:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:05:29,499 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,499 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] [2019-09-16 17:05:29,499 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1902481995, now seen corresponding path program 1 times [2019-09-16 17:05:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,607 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-16 17:05:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,956 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-16 17:05:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-16 17:05:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,960 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:05:29,960 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:05:29,961 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:05:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-16 17:05:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-16 17:05:29,973 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 62 [2019-09-16 17:05:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,973 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-16 17:05:29,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-16 17:05:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:05:29,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,976 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] [2019-09-16 17:05:29,977 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 854971191, now seen corresponding path program 1 times [2019-09-16 17:05:29,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:30,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:30,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:30,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:30,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:30,140 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-16 17:05:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,675 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-16 17:05:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:30,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-16 17:05:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,677 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:05:30,677 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:05:30,678 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:05:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-16 17:05:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-16 17:05:30,692 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 62 [2019-09-16 17:05:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,698 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-16 17:05:30,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-16 17:05:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:05:30,702 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,703 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] [2019-09-16 17:05:30,703 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -630902145, now seen corresponding path program 1 times [2019-09-16 17:05:30,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:30,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,810 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-16 17:05:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,140 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-16 17:05:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-16 17:05:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,142 INFO L225 Difference]: With dead ends: 187 [2019-09-16 17:05:31,143 INFO L226 Difference]: Without dead ends: 187 [2019-09-16 17:05:31,143 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-16 17:05:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-16 17:05:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-16 17:05:31,152 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 62 [2019-09-16 17:05:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,152 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-16 17:05:31,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-16 17:05:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:05:31,154 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,154 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] [2019-09-16 17:05:31,154 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -771628832, now seen corresponding path program 1 times [2019-09-16 17:05:31,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,235 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-16 17:05:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,505 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-16 17:05:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-16 17:05:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,507 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:31,507 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:31,508 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-16 17:05:31,516 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 62 [2019-09-16 17:05:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,516 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-16 17:05:31,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-16 17:05:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:31,518 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,518 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-16 17:05:31,518 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2105220290, now seen corresponding path program 1 times [2019-09-16 17:05:31,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:31,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,587 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-16 17:05:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,861 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-16 17:05:31,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,864 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:31,864 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:31,865 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-16 17:05:31,871 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 63 [2019-09-16 17:05:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,872 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-16 17:05:31,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-16 17:05:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:31,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,874 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] [2019-09-16 17:05:31,874 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 521183299, now seen corresponding path program 1 times [2019-09-16 17:05:31,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:31,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,985 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-16 17:05:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,292 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-16 17:05:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,294 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:32,294 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:32,295 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-16 17:05:32,300 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 64 [2019-09-16 17:05:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,301 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-16 17:05:32,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-16 17:05:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:32,302 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,302 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] [2019-09-16 17:05:32,302 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -74560473, now seen corresponding path program 1 times [2019-09-16 17:05:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:32,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,359 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-16 17:05:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,687 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-16 17:05:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,689 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:32,690 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:32,690 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-16 17:05:32,696 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 65 [2019-09-16 17:05:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,696 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-16 17:05:32,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-16 17:05:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:32,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,698 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] [2019-09-16 17:05:32,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1189974552, now seen corresponding path program 1 times [2019-09-16 17:05:32,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:32,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,796 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-16 17:05:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,110 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-16 17:05:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,112 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:33,112 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:33,112 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-16 17:05:33,119 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 65 [2019-09-16 17:05:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,120 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-16 17:05:33,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-16 17:05:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:05:33,121 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,121 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] [2019-09-16 17:05:33,121 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -97985528, now seen corresponding path program 1 times [2019-09-16 17:05:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:33,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,191 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-16 17:05:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,444 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:05:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:05:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,447 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:33,447 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:33,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-16 17:05:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-16 17:05:33,456 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 66 [2019-09-16 17:05:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,456 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-16 17:05:33,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-16 17:05:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:33,458 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,458 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] [2019-09-16 17:05:33,458 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 541884667, now seen corresponding path program 1 times [2019-09-16 17:05:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:33,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,540 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-16 17:05:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,893 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:05:33,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,895 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:33,895 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:33,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-16 17:05:33,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 78 [2019-09-16 17:05:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,903 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-16 17:05:33,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-16 17:05:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:33,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,904 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] [2019-09-16 17:05:33,905 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1649224931, now seen corresponding path program 1 times [2019-09-16 17:05:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:34,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,027 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-16 17:05:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,356 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-16 17:05:34,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,359 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:05:34,359 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:05:34,359 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:05:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-16 17:05:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-16 17:05:34,364 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 79 [2019-09-16 17:05:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,365 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-16 17:05:34,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-16 17:05:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:34,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,366 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] [2019-09-16 17:05:34,366 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1508498244, now seen corresponding path program 1 times [2019-09-16 17:05:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:34,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,436 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-16 17:05:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,745 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-16 17:05:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,746 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:34,747 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:34,747 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-16 17:05:34,753 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 79 [2019-09-16 17:05:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,753 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-16 17:05:34,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-16 17:05:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:34,755 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,755 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] [2019-09-16 17:05:34,755 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash -225284386, now seen corresponding path program 1 times [2019-09-16 17:05:34,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:34,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,849 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-16 17:05:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,180 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-16 17:05:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,182 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:35,182 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:35,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-16 17:05:35,189 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 80 [2019-09-16 17:05:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,189 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-16 17:05:35,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-16 17:05:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:35,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,191 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] [2019-09-16 17:05:35,191 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1289982375, now seen corresponding path program 1 times [2019-09-16 17:05:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:35,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,257 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-16 17:05:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,651 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-16 17:05:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,655 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:35,655 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:35,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-16 17:05:35,663 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 81 [2019-09-16 17:05:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,664 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-16 17:05:35,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-16 17:05:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:05:35,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,666 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] [2019-09-16 17:05:35,666 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2011592893, now seen corresponding path program 1 times [2019-09-16 17:05:35,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,765 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-16 17:05:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,097 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-16 17:05:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:05:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,099 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:36,099 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:36,100 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-16 17:05:36,106 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 82 [2019-09-16 17:05:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,106 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-16 17:05:36,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-16 17:05:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:36,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,108 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] [2019-09-16 17:05:36,109 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash -16448404, now seen corresponding path program 1 times [2019-09-16 17:05:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,204 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-16 17:05:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,494 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-16 17:05:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:05:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,497 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:05:36,497 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:05:36,498 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:05:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-16 17:05:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-16 17:05:36,506 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 83 [2019-09-16 17:05:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,506 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-16 17:05:36,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-16 17:05:36,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:05:36,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,508 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] [2019-09-16 17:05:36,508 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1230282092, now seen corresponding path program 1 times [2019-09-16 17:05:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,612 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-16 17:05:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,125 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-16 17:05:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:05:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,128 INFO L225 Difference]: With dead ends: 300 [2019-09-16 17:05:37,128 INFO L226 Difference]: Without dead ends: 300 [2019-09-16 17:05:37,129 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-16 17:05:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 235. [2019-09-16 17:05:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-16 17:05:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 354 transitions. [2019-09-16 17:05:37,135 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 354 transitions. Word has length 87 [2019-09-16 17:05:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,136 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 354 transitions. [2019-09-16 17:05:37,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 354 transitions. [2019-09-16 17:05:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:05:37,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,137 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] [2019-09-16 17:05:37,137 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1692877906, now seen corresponding path program 1 times [2019-09-16 17:05:37,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:37,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,214 INFO L87 Difference]: Start difference. First operand 235 states and 354 transitions. Second operand 4 states. [2019-09-16 17:05:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,665 INFO L93 Difference]: Finished difference Result 283 states and 425 transitions. [2019-09-16 17:05:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:05:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,668 INFO L225 Difference]: With dead ends: 283 [2019-09-16 17:05:37,668 INFO L226 Difference]: Without dead ends: 283 [2019-09-16 17:05:37,668 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-16 17:05:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2019-09-16 17:05:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-16 17:05:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 395 transitions. [2019-09-16 17:05:37,675 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 395 transitions. Word has length 87 [2019-09-16 17:05:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,676 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 395 transitions. [2019-09-16 17:05:37,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 395 transitions. [2019-09-16 17:05:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:05:37,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,677 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-16 17:05:37,678 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash 314475640, now seen corresponding path program 1 times [2019-09-16 17:05:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:37,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,773 INFO L87 Difference]: Start difference. First operand 259 states and 395 transitions. Second operand 4 states. [2019-09-16 17:05:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,414 INFO L93 Difference]: Finished difference Result 317 states and 473 transitions. [2019-09-16 17:05:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:05:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,417 INFO L225 Difference]: With dead ends: 317 [2019-09-16 17:05:38,417 INFO L226 Difference]: Without dead ends: 317 [2019-09-16 17:05:38,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-16 17:05:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-16 17:05:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-09-16 17:05:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 396 transitions. [2019-09-16 17:05:38,426 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 396 transitions. Word has length 88 [2019-09-16 17:05:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,426 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 396 transitions. [2019-09-16 17:05:38,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 396 transitions. [2019-09-16 17:05:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-16 17:05:38,428 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,428 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] [2019-09-16 17:05:38,429 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 518226895, now seen corresponding path program 1 times [2019-09-16 17:05:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,531 INFO L87 Difference]: Start difference. First operand 260 states and 396 transitions. Second operand 4 states. [2019-09-16 17:05:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,120 INFO L93 Difference]: Finished difference Result 317 states and 472 transitions. [2019-09-16 17:05:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-16 17:05:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,123 INFO L225 Difference]: With dead ends: 317 [2019-09-16 17:05:39,123 INFO L226 Difference]: Without dead ends: 317 [2019-09-16 17:05:39,124 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-16 17:05:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-09-16 17:05:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 395 transitions. [2019-09-16 17:05:39,131 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 395 transitions. Word has length 100 [2019-09-16 17:05:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,132 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 395 transitions. [2019-09-16 17:05:39,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 395 transitions. [2019-09-16 17:05:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-16 17:05:39,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,134 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] [2019-09-16 17:05:39,134 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash 962127569, now seen corresponding path program 1 times [2019-09-16 17:05:39,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:39,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,224 INFO L87 Difference]: Start difference. First operand 260 states and 395 transitions. Second operand 4 states. [2019-09-16 17:05:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,665 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-09-16 17:05:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-16 17:05:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,668 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:05:39,668 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:05:39,669 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:05:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-16 17:05:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-16 17:05:39,677 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 100 [2019-09-16 17:05:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,678 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-16 17:05:39,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-16 17:05:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:05:39,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,680 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] [2019-09-16 17:05:39,680 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 915833999, now seen corresponding path program 1 times [2019-09-16 17:05:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,774 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-16 17:05:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,293 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-16 17:05:40,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:05:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,297 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:05:40,297 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:05:40,298 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:05:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 260. [2019-09-16 17:05:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-16 17:05:40,306 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 101 [2019-09-16 17:05:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,307 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-16 17:05:40,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-16 17:05:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:05:40,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,310 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] [2019-09-16 17:05:40,310 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,311 INFO L82 PathProgramCache]: Analyzing trace with hash 775107312, now seen corresponding path program 1 times [2019-09-16 17:05:40,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:40,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,467 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,928 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-09-16 17:05:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:05:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,931 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:40,931 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:40,932 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2019-09-16 17:05:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-16 17:05:40,939 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 101 [2019-09-16 17:05:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-16 17:05:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-16 17:05:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:05:40,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,941 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] [2019-09-16 17:05:40,941 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1791853005, now seen corresponding path program 1 times [2019-09-16 17:05:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,005 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-16 17:05:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,416 INFO L93 Difference]: Finished difference Result 283 states and 420 transitions. [2019-09-16 17:05:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:05:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,420 INFO L225 Difference]: With dead ends: 283 [2019-09-16 17:05:41,420 INFO L226 Difference]: Without dead ends: 283 [2019-09-16 17:05:41,420 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-16 17:05:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2019-09-16 17:05:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-16 17:05:41,430 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 101 [2019-09-16 17:05:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,430 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-16 17:05:41,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-16 17:05:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:05:41,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,433 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] [2019-09-16 17:05:41,433 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1651126318, now seen corresponding path program 1 times [2019-09-16 17:05:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:41,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,535 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-16 17:05:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,883 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2019-09-16 17:05:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:05:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,886 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:41,886 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:41,886 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2019-09-16 17:05:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-16 17:05:41,893 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 101 [2019-09-16 17:05:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,893 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-16 17:05:41,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-16 17:05:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:41,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,895 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] [2019-09-16 17:05:41,895 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1485566798, now seen corresponding path program 1 times [2019-09-16 17:05:41,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:41,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,953 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-16 17:05:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,395 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2019-09-16 17:05:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:05:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,397 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:42,397 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:42,398 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2019-09-16 17:05:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-16 17:05:42,404 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 102 [2019-09-16 17:05:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,405 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-16 17:05:42,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-16 17:05:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:05:42,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,407 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] [2019-09-16 17:05:42,407 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash -98781388, now seen corresponding path program 1 times [2019-09-16 17:05:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:42,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,480 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-16 17:05:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,835 INFO L93 Difference]: Finished difference Result 281 states and 415 transitions. [2019-09-16 17:05:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:05:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,838 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:42,838 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:42,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2019-09-16 17:05:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-16 17:05:42,847 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 102 [2019-09-16 17:05:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,848 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-16 17:05:42,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-16 17:05:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:42,850 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,850 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] [2019-09-16 17:05:42,850 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash 875933267, now seen corresponding path program 1 times [2019-09-16 17:05:42,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:42,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,945 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-16 17:05:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,392 INFO L93 Difference]: Finished difference Result 314 states and 461 transitions. [2019-09-16 17:05:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,395 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:43,395 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:43,395 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2019-09-16 17:05:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-16 17:05:43,403 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 103 [2019-09-16 17:05:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,403 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-16 17:05:43,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-16 17:05:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:43,404 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,405 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] [2019-09-16 17:05:43,405 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash 916608017, now seen corresponding path program 1 times [2019-09-16 17:05:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,470 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-16 17:05:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,799 INFO L93 Difference]: Finished difference Result 281 states and 413 transitions. [2019-09-16 17:05:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,801 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:43,801 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:43,802 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2019-09-16 17:05:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-16 17:05:43,808 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 103 [2019-09-16 17:05:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,808 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-16 17:05:43,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-16 17:05:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:43,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,810 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] [2019-09-16 17:05:43,810 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1962213353, now seen corresponding path program 1 times [2019-09-16 17:05:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:43,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,885 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-16 17:05:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,355 INFO L93 Difference]: Finished difference Result 314 states and 459 transitions. [2019-09-16 17:05:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,357 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:05:44,358 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:05:44,358 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:05:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2019-09-16 17:05:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-16 17:05:44,364 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 104 [2019-09-16 17:05:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,365 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-16 17:05:44,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-16 17:05:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:44,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,366 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] [2019-09-16 17:05:44,366 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -701296103, now seen corresponding path program 1 times [2019-09-16 17:05:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,435 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-16 17:05:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:44,750 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2019-09-16 17:05:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:44,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:44,753 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:44,753 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:44,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2019-09-16 17:05:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-16 17:05:44,760 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 104 [2019-09-16 17:05:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:44,761 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-16 17:05:44,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-16 17:05:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:44,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:44,762 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] [2019-09-16 17:05:44,762 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1514317336, now seen corresponding path program 1 times [2019-09-16 17:05:44,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:44,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:44,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:44,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:44,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:44,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:44,836 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-16 17:05:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,293 INFO L93 Difference]: Finished difference Result 304 states and 445 transitions. [2019-09-16 17:05:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,295 INFO L225 Difference]: With dead ends: 304 [2019-09-16 17:05:45,295 INFO L226 Difference]: Without dead ends: 304 [2019-09-16 17:05:45,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-16 17:05:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 260. [2019-09-16 17:05:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-16 17:05:45,302 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 105 [2019-09-16 17:05:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,302 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-16 17:05:45,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-16 17:05:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:45,304 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,304 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] [2019-09-16 17:05:45,304 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1948046422, now seen corresponding path program 1 times [2019-09-16 17:05:45,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,376 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-16 17:05:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:45,675 INFO L93 Difference]: Finished difference Result 271 states and 397 transitions. [2019-09-16 17:05:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:45,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:45,678 INFO L225 Difference]: With dead ends: 271 [2019-09-16 17:05:45,679 INFO L226 Difference]: Without dead ends: 271 [2019-09-16 17:05:45,679 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-16 17:05:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 260. [2019-09-16 17:05:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-16 17:05:45,685 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 105 [2019-09-16 17:05:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:45,685 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-16 17:05:45,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-16 17:05:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-16 17:05:45,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:45,687 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] [2019-09-16 17:05:45,687 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1489313836, now seen corresponding path program 1 times [2019-09-16 17:05:45,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:45,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:45,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:45,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:45,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:45,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:45,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:45,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:45,758 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-16 17:05:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,178 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-09-16 17:05:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-16 17:05:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,180 INFO L225 Difference]: With dead ends: 304 [2019-09-16 17:05:46,183 INFO L226 Difference]: Without dead ends: 304 [2019-09-16 17:05:46,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-16 17:05:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 260. [2019-09-16 17:05:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-16 17:05:46,190 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 109 [2019-09-16 17:05:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,190 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-16 17:05:46,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-16 17:05:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-16 17:05:46,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,192 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] [2019-09-16 17:05:46,192 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2126381206, now seen corresponding path program 1 times [2019-09-16 17:05:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:46,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,271 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-16 17:05:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:46,624 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2019-09-16 17:05:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:46,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-16 17:05:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:46,628 INFO L225 Difference]: With dead ends: 312 [2019-09-16 17:05:46,628 INFO L226 Difference]: Without dead ends: 312 [2019-09-16 17:05:46,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-16 17:05:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 286. [2019-09-16 17:05:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 426 transitions. [2019-09-16 17:05:46,634 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 426 transitions. Word has length 109 [2019-09-16 17:05:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:46,634 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 426 transitions. [2019-09-16 17:05:46,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 426 transitions. [2019-09-16 17:05:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:05:46,636 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,636 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:46,636 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1494784396, now seen corresponding path program 1 times [2019-09-16 17:05:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:46,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:46,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:46,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:46,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:46,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:46,717 INFO L87 Difference]: Start difference. First operand 286 states and 426 transitions. Second operand 4 states. [2019-09-16 17:05:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,129 INFO L93 Difference]: Finished difference Result 330 states and 487 transitions. [2019-09-16 17:05:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-16 17:05:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,132 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:05:47,132 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:05:47,132 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:05:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 286. [2019-09-16 17:05:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 425 transitions. [2019-09-16 17:05:47,139 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 425 transitions. Word has length 112 [2019-09-16 17:05:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,139 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 425 transitions. [2019-09-16 17:05:47,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 425 transitions. [2019-09-16 17:05:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-16 17:05:47,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,141 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,141 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1694632685, now seen corresponding path program 1 times [2019-09-16 17:05:47,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:47,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,230 INFO L87 Difference]: Start difference. First operand 286 states and 425 transitions. Second operand 4 states. [2019-09-16 17:05:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,684 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-09-16 17:05:47,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-16 17:05:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,687 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:05:47,687 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:05:47,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:05:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2019-09-16 17:05:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 424 transitions. [2019-09-16 17:05:47,694 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 424 transitions. Word has length 113 [2019-09-16 17:05:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,694 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 424 transitions. [2019-09-16 17:05:47,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 424 transitions. [2019-09-16 17:05:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-16 17:05:47,695 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,696 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:47,696 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 587139250, now seen corresponding path program 1 times [2019-09-16 17:05:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:47,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,778 INFO L87 Difference]: Start difference. First operand 286 states and 424 transitions. Second operand 4 states. [2019-09-16 17:05:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,178 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2019-09-16 17:05:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-16 17:05:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,181 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:05:48,181 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:05:48,182 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:05:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2019-09-16 17:05:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 423 transitions. [2019-09-16 17:05:48,188 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 423 transitions. Word has length 114 [2019-09-16 17:05:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,189 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 423 transitions. [2019-09-16 17:05:48,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 423 transitions. [2019-09-16 17:05:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-16 17:05:48,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,190 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,191 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2066897751, now seen corresponding path program 1 times [2019-09-16 17:05:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:48,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,284 INFO L87 Difference]: Start difference. First operand 286 states and 423 transitions. Second operand 4 states. [2019-09-16 17:05:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,675 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2019-09-16 17:05:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-16 17:05:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,679 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:05:48,679 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:05:48,679 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:05:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2019-09-16 17:05:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 422 transitions. [2019-09-16 17:05:48,686 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 422 transitions. Word has length 115 [2019-09-16 17:05:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,686 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 422 transitions. [2019-09-16 17:05:48,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 422 transitions. [2019-09-16 17:05:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-16 17:05:48,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,688 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:48,688 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1100183949, now seen corresponding path program 1 times [2019-09-16 17:05:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,763 INFO L87 Difference]: Start difference. First operand 286 states and 422 transitions. Second operand 4 states. [2019-09-16 17:05:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,116 INFO L93 Difference]: Finished difference Result 320 states and 468 transitions. [2019-09-16 17:05:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-16 17:05:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,119 INFO L225 Difference]: With dead ends: 320 [2019-09-16 17:05:49,119 INFO L226 Difference]: Without dead ends: 320 [2019-09-16 17:05:49,119 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-16 17:05:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 286. [2019-09-16 17:05:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2019-09-16 17:05:49,125 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 421 transitions. Word has length 115 [2019-09-16 17:05:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,125 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 421 transitions. [2019-09-16 17:05:49,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 421 transitions. [2019-09-16 17:05:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:05:49,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,127 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,127 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash -630094090, now seen corresponding path program 1 times [2019-09-16 17:05:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:49,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,214 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. Second operand 4 states. [2019-09-16 17:05:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,601 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2019-09-16 17:05:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:05:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,603 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:05:49,603 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:05:49,603 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:05:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 286. [2019-09-16 17:05:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2019-09-16 17:05:49,609 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 116 [2019-09-16 17:05:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2019-09-16 17:05:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2019-09-16 17:05:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:05:49,611 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,611 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:49,612 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash -155503596, now seen corresponding path program 1 times [2019-09-16 17:05:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:49,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,693 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand 4 states. [2019-09-16 17:05:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,082 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-16 17:05:50,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:05:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,084 INFO L225 Difference]: With dead ends: 315 [2019-09-16 17:05:50,084 INFO L226 Difference]: Without dead ends: 315 [2019-09-16 17:05:50,085 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-16 17:05:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 286. [2019-09-16 17:05:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2019-09-16 17:05:50,090 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 116 [2019-09-16 17:05:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,091 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2019-09-16 17:05:50,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2019-09-16 17:05:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-16 17:05:50,092 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,092 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,092 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1961510798, now seen corresponding path program 1 times [2019-09-16 17:05:50,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:50,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,178 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand 4 states. [2019-09-16 17:05:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,581 INFO L93 Difference]: Finished difference Result 315 states and 458 transitions. [2019-09-16 17:05:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-16 17:05:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,584 INFO L225 Difference]: With dead ends: 315 [2019-09-16 17:05:50,584 INFO L226 Difference]: Without dead ends: 315 [2019-09-16 17:05:50,584 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-16 17:05:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 286. [2019-09-16 17:05:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2019-09-16 17:05:50,590 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 118 [2019-09-16 17:05:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,590 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2019-09-16 17:05:50,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2019-09-16 17:05:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-16 17:05:50,591 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,591 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:50,592 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 33271790, now seen corresponding path program 1 times [2019-09-16 17:05:50,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,670 INFO L87 Difference]: Start difference. First operand 286 states and 418 transitions. Second operand 4 states. [2019-09-16 17:05:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,025 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2019-09-16 17:05:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-16 17:05:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,028 INFO L225 Difference]: With dead ends: 311 [2019-09-16 17:05:51,028 INFO L226 Difference]: Without dead ends: 311 [2019-09-16 17:05:51,028 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-16 17:05:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 286. [2019-09-16 17:05:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 417 transitions. [2019-09-16 17:05:51,034 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 417 transitions. Word has length 119 [2019-09-16 17:05:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,034 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 417 transitions. [2019-09-16 17:05:51,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 417 transitions. [2019-09-16 17:05:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-16 17:05:51,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,036 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,036 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1301018173, now seen corresponding path program 1 times [2019-09-16 17:05:51,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:51,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,132 INFO L87 Difference]: Start difference. First operand 286 states and 417 transitions. Second operand 4 states. [2019-09-16 17:05:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,527 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2019-09-16 17:05:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-16 17:05:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,530 INFO L225 Difference]: With dead ends: 311 [2019-09-16 17:05:51,530 INFO L226 Difference]: Without dead ends: 311 [2019-09-16 17:05:51,531 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-16 17:05:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 286. [2019-09-16 17:05:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2019-09-16 17:05:51,536 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 119 [2019-09-16 17:05:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,537 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2019-09-16 17:05:51,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2019-09-16 17:05:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:05:51,538 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,539 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,539 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1753231647, now seen corresponding path program 1 times [2019-09-16 17:05:51,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,614 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand 4 states. [2019-09-16 17:05:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,963 INFO L93 Difference]: Finished difference Result 309 states and 448 transitions. [2019-09-16 17:05:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-16 17:05:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,966 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:05:51,966 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:05:51,966 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:05:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2019-09-16 17:05:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 415 transitions. [2019-09-16 17:05:51,972 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 415 transitions. Word has length 120 [2019-09-16 17:05:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,972 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 415 transitions. [2019-09-16 17:05:51,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2019-09-16 17:05:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:05:51,973 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,974 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:51,974 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash 738212514, now seen corresponding path program 1 times [2019-09-16 17:05:51,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,056 INFO L87 Difference]: Start difference. First operand 286 states and 415 transitions. Second operand 4 states. [2019-09-16 17:05:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,420 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2019-09-16 17:05:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:05:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,423 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:05:52,423 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:05:52,423 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:05:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2019-09-16 17:05:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 414 transitions. [2019-09-16 17:05:52,429 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 414 transitions. Word has length 121 [2019-09-16 17:05:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,429 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 414 transitions. [2019-09-16 17:05:52,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 414 transitions. [2019-09-16 17:05:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:05:52,431 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,431 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,431 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1401201946, now seen corresponding path program 1 times [2019-09-16 17:05:52,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,561 INFO L87 Difference]: Start difference. First operand 286 states and 414 transitions. Second operand 4 states. [2019-09-16 17:05:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,909 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2019-09-16 17:05:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:05:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,911 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:52,911 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:52,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 286. [2019-09-16 17:05:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-16 17:05:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 413 transitions. [2019-09-16 17:05:52,917 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 413 transitions. Word has length 122 [2019-09-16 17:05:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,918 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 413 transitions. [2019-09-16 17:05:52,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 413 transitions. [2019-09-16 17:05:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:05:52,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,919 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:52,919 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1370426695, now seen corresponding path program 1 times [2019-09-16 17:05:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-16 17:05:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,993 INFO L87 Difference]: Start difference. First operand 286 states and 413 transitions. Second operand 4 states. [2019-09-16 17:05:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,406 INFO L93 Difference]: Finished difference Result 357 states and 522 transitions. [2019-09-16 17:05:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:05:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,409 INFO L225 Difference]: With dead ends: 357 [2019-09-16 17:05:53,409 INFO L226 Difference]: Without dead ends: 357 [2019-09-16 17:05:53,410 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-16 17:05:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 318. [2019-09-16 17:05:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-16 17:05:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 470 transitions. [2019-09-16 17:05:53,415 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 470 transitions. Word has length 122 [2019-09-16 17:05:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,416 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 470 transitions. [2019-09-16 17:05:53,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 470 transitions. [2019-09-16 17:05:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:05:53,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,417 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,417 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1797852443, now seen corresponding path program 1 times [2019-09-16 17:05:53,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:05:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,493 INFO L87 Difference]: Start difference. First operand 318 states and 470 transitions. Second operand 4 states. [2019-09-16 17:05:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,962 INFO L93 Difference]: Finished difference Result 422 states and 629 transitions. [2019-09-16 17:05:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:05:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,966 INFO L225 Difference]: With dead ends: 422 [2019-09-16 17:05:53,966 INFO L226 Difference]: Without dead ends: 422 [2019-09-16 17:05:53,966 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-16 17:05:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 357. [2019-09-16 17:05:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-16 17:05:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 541 transitions. [2019-09-16 17:05:53,972 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 541 transitions. Word has length 123 [2019-09-16 17:05:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,973 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 541 transitions. [2019-09-16 17:05:53,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 541 transitions. [2019-09-16 17:05:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:05:53,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,974 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:53,974 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash 289499420, now seen corresponding path program 1 times [2019-09-16 17:05:53,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,049 INFO L87 Difference]: Start difference. First operand 357 states and 541 transitions. Second operand 4 states. [2019-09-16 17:05:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,418 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2019-09-16 17:05:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:05:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,422 INFO L225 Difference]: With dead ends: 383 [2019-09-16 17:05:54,422 INFO L226 Difference]: Without dead ends: 383 [2019-09-16 17:05:54,423 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-16 17:05:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 357. [2019-09-16 17:05:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-16 17:05:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 540 transitions. [2019-09-16 17:05:54,430 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 540 transitions. Word has length 124 [2019-09-16 17:05:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,430 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 540 transitions. [2019-09-16 17:05:54,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 540 transitions. [2019-09-16 17:05:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:05:54,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,432 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:54,432 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -100336057, now seen corresponding path program 1 times [2019-09-16 17:05:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:05:54,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,514 INFO L87 Difference]: Start difference. First operand 357 states and 540 transitions. Second operand 4 states. [2019-09-16 17:05:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,968 INFO L93 Difference]: Finished difference Result 415 states and 618 transitions. [2019-09-16 17:05:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:05:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,970 INFO L225 Difference]: With dead ends: 415 [2019-09-16 17:05:54,970 INFO L226 Difference]: Without dead ends: 415 [2019-09-16 17:05:54,970 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-16 17:05:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 356. [2019-09-16 17:05:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 17:05:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2019-09-16 17:05:54,975 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 124 [2019-09-16 17:05:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,976 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2019-09-16 17:05:54,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2019-09-16 17:05:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:05:54,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,977 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:54,977 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 68411177, now seen corresponding path program 1 times [2019-09-16 17:05:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:55,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,052 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand 4 states. [2019-09-16 17:05:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,403 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2019-09-16 17:05:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:05:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,406 INFO L225 Difference]: With dead ends: 382 [2019-09-16 17:05:55,406 INFO L226 Difference]: Without dead ends: 382 [2019-09-16 17:05:55,406 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-16 17:05:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 356. [2019-09-16 17:05:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 17:05:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2019-09-16 17:05:55,411 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 125 [2019-09-16 17:05:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,411 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2019-09-16 17:05:55,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2019-09-16 17:05:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-16 17:05:55,412 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,413 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:55,413 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1225594367, now seen corresponding path program 1 times [2019-09-16 17:05:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:55,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,483 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand 4 states. [2019-09-16 17:05:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,813 INFO L93 Difference]: Finished difference Result 382 states and 570 transitions. [2019-09-16 17:05:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-16 17:05:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,817 INFO L225 Difference]: With dead ends: 382 [2019-09-16 17:05:55,817 INFO L226 Difference]: Without dead ends: 382 [2019-09-16 17:05:55,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-16 17:05:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 356. [2019-09-16 17:05:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 17:05:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 537 transitions. [2019-09-16 17:05:55,824 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 537 transitions. Word has length 126 [2019-09-16 17:05:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,824 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 537 transitions. [2019-09-16 17:05:55,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 537 transitions. [2019-09-16 17:05:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:05:55,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,826 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:55,826 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1420297874, now seen corresponding path program 1 times [2019-09-16 17:05:55,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,897 INFO L87 Difference]: Start difference. First operand 356 states and 537 transitions. Second operand 4 states. [2019-09-16 17:05:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,202 INFO L93 Difference]: Finished difference Result 372 states and 557 transitions. [2019-09-16 17:05:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:05:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,205 INFO L225 Difference]: With dead ends: 372 [2019-09-16 17:05:56,205 INFO L226 Difference]: Without dead ends: 372 [2019-09-16 17:05:56,205 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-16 17:05:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2019-09-16 17:05:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 17:05:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 536 transitions. [2019-09-16 17:05:56,211 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 536 transitions. Word has length 127 [2019-09-16 17:05:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,212 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 536 transitions. [2019-09-16 17:05:56,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 536 transitions. [2019-09-16 17:05:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:05:56,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,214 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:56,215 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -984823716, now seen corresponding path program 1 times [2019-09-16 17:05:56,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:56,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,289 INFO L87 Difference]: Start difference. First operand 356 states and 536 transitions. Second operand 4 states. [2019-09-16 17:05:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,920 INFO L93 Difference]: Finished difference Result 460 states and 695 transitions. [2019-09-16 17:05:56,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:05:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,923 INFO L225 Difference]: With dead ends: 460 [2019-09-16 17:05:56,923 INFO L226 Difference]: Without dead ends: 460 [2019-09-16 17:05:56,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-16 17:05:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 395. [2019-09-16 17:05:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-16 17:05:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 607 transitions. [2019-09-16 17:05:56,929 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 607 transitions. Word has length 128 [2019-09-16 17:05:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,930 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 607 transitions. [2019-09-16 17:05:56,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 607 transitions. [2019-09-16 17:05:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:05:56,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,931 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:56,931 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -666249296, now seen corresponding path program 1 times [2019-09-16 17:05:56,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,016 INFO L87 Difference]: Start difference. First operand 395 states and 607 transitions. Second operand 4 states. [2019-09-16 17:05:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,490 INFO L93 Difference]: Finished difference Result 453 states and 685 transitions. [2019-09-16 17:05:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-16 17:05:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,494 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:05:57,494 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:05:57,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:05:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 356. [2019-09-16 17:05:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 17:05:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 536 transitions. [2019-09-16 17:05:57,500 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 536 transitions. Word has length 129 [2019-09-16 17:05:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,500 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 536 transitions. [2019-09-16 17:05:57,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 536 transitions. [2019-09-16 17:05:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-16 17:05:57,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,501 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:57,502 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash -947541210, now seen corresponding path program 1 times [2019-09-16 17:05:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:57,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,574 INFO L87 Difference]: Start difference. First operand 356 states and 536 transitions. Second operand 4 states. [2019-09-16 17:05:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,910 INFO L93 Difference]: Finished difference Result 371 states and 555 transitions. [2019-09-16 17:05:57,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-16 17:05:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,912 INFO L225 Difference]: With dead ends: 371 [2019-09-16 17:05:57,912 INFO L226 Difference]: Without dead ends: 371 [2019-09-16 17:05:57,913 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-16 17:05:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2019-09-16 17:05:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:05:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 539 transitions. [2019-09-16 17:05:57,919 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 539 transitions. Word has length 130 [2019-09-16 17:05:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,919 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 539 transitions. [2019-09-16 17:05:57,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 539 transitions. [2019-09-16 17:05:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-16 17:05:57,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,921 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:57,921 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2014416365, now seen corresponding path program 1 times [2019-09-16 17:05:57,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:05:58,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,029 INFO L87 Difference]: Start difference. First operand 359 states and 539 transitions. Second operand 4 states. [2019-09-16 17:05:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,327 INFO L93 Difference]: Finished difference Result 375 states and 559 transitions. [2019-09-16 17:05:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-16 17:05:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,331 INFO L225 Difference]: With dead ends: 375 [2019-09-16 17:05:58,331 INFO L226 Difference]: Without dead ends: 375 [2019-09-16 17:05:58,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-16 17:05:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2019-09-16 17:05:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:05:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 538 transitions. [2019-09-16 17:05:58,337 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 538 transitions. Word has length 137 [2019-09-16 17:05:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,338 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 538 transitions. [2019-09-16 17:05:58,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 538 transitions. [2019-09-16 17:05:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-16 17:05:58,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,339 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] [2019-09-16 17:05:58,340 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1624242989, now seen corresponding path program 1 times [2019-09-16 17:05:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:58,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,419 INFO L87 Difference]: Start difference. First operand 359 states and 538 transitions. Second operand 4 states. [2019-09-16 17:05:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,820 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2019-09-16 17:05:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-16 17:05:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,824 INFO L225 Difference]: With dead ends: 421 [2019-09-16 17:05:58,824 INFO L226 Difference]: Without dead ends: 421 [2019-09-16 17:05:58,824 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-16 17:05:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 387. [2019-09-16 17:05:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-16 17:05:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 587 transitions. [2019-09-16 17:05:58,829 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 587 transitions. Word has length 137 [2019-09-16 17:05:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,829 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 587 transitions. [2019-09-16 17:05:58,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 587 transitions. [2019-09-16 17:05:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:05:58,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,831 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:58,831 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1176653759, now seen corresponding path program 1 times [2019-09-16 17:05:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:05:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,898 INFO L87 Difference]: Start difference. First operand 387 states and 587 transitions. Second operand 4 states. [2019-09-16 17:05:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,339 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2019-09-16 17:05:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:05:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,343 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:05:59,343 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:05:59,343 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:05:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 399. [2019-09-16 17:05:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-16 17:05:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2019-09-16 17:05:59,348 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 138 [2019-09-16 17:05:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,349 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2019-09-16 17:05:59,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2019-09-16 17:05:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:05:59,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,350 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,351 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1277930560, now seen corresponding path program 1 times [2019-09-16 17:05:59,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:05:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,424 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand 4 states. [2019-09-16 17:05:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,699 INFO L93 Difference]: Finished difference Result 413 states and 622 transitions. [2019-09-16 17:05:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:05:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,703 INFO L225 Difference]: With dead ends: 413 [2019-09-16 17:05:59,703 INFO L226 Difference]: Without dead ends: 413 [2019-09-16 17:05:59,703 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-16 17:05:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 399. [2019-09-16 17:05:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-16 17:05:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2019-09-16 17:05:59,708 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 138 [2019-09-16 17:05:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,708 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2019-09-16 17:05:59,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2019-09-16 17:05:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:05:59,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,710 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,710 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1862302884, now seen corresponding path program 1 times [2019-09-16 17:05:59,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:05:59,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,777 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand 4 states. [2019-09-16 17:06:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,227 INFO L93 Difference]: Finished difference Result 484 states and 733 transitions. [2019-09-16 17:06:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-16 17:06:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,231 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:06:00,231 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:06:00,232 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:06:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2019-09-16 17:06:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-16 17:06:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 604 transitions. [2019-09-16 17:06:00,237 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 604 transitions. Word has length 139 [2019-09-16 17:06:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,237 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 604 transitions. [2019-09-16 17:06:00,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 604 transitions. [2019-09-16 17:06:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:06:00,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,238 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,238 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1449526298, now seen corresponding path program 1 times [2019-09-16 17:06:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:00,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,306 INFO L87 Difference]: Start difference. First operand 400 states and 604 transitions. Second operand 4 states. [2019-09-16 17:06:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,761 INFO L93 Difference]: Finished difference Result 484 states and 732 transitions. [2019-09-16 17:06:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:06:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,765 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:06:00,765 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:06:00,766 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:06:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2019-09-16 17:06:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-16 17:06:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 605 transitions. [2019-09-16 17:06:00,772 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 605 transitions. Word has length 140 [2019-09-16 17:06:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,772 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 605 transitions. [2019-09-16 17:06:00,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 605 transitions. [2019-09-16 17:06:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:00,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,774 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,774 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 227746857, now seen corresponding path program 1 times [2019-09-16 17:06:00,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,875 INFO L87 Difference]: Start difference. First operand 401 states and 605 transitions. Second operand 4 states. [2019-09-16 17:06:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,294 INFO L93 Difference]: Finished difference Result 474 states and 719 transitions. [2019-09-16 17:06:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,298 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:06:01,299 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:06:01,299 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:06:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 402. [2019-09-16 17:06:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 606 transitions. [2019-09-16 17:06:01,305 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 606 transitions. Word has length 141 [2019-09-16 17:06:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 606 transitions. [2019-09-16 17:06:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 606 transitions. [2019-09-16 17:06:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:06:01,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,307 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:01,307 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 691101162, now seen corresponding path program 1 times [2019-09-16 17:06:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,385 INFO L87 Difference]: Start difference. First operand 402 states and 606 transitions. Second operand 4 states. [2019-09-16 17:06:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,842 INFO L93 Difference]: Finished difference Result 484 states and 730 transitions. [2019-09-16 17:06:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:06:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,846 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:06:01,847 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:06:01,847 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:06:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2019-09-16 17:06:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 605 transitions. [2019-09-16 17:06:01,852 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 605 transitions. Word has length 143 [2019-09-16 17:06:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,852 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 605 transitions. [2019-09-16 17:06:01,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 605 transitions. [2019-09-16 17:06:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:06:01,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,854 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:01,854 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -366836709, now seen corresponding path program 1 times [2019-09-16 17:06:01,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:01,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,941 INFO L87 Difference]: Start difference. First operand 402 states and 605 transitions. Second operand 4 states. [2019-09-16 17:06:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,407 INFO L93 Difference]: Finished difference Result 484 states and 729 transitions. [2019-09-16 17:06:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:06:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,411 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:06:02,411 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:06:02,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:06:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2019-09-16 17:06:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 604 transitions. [2019-09-16 17:06:02,418 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 604 transitions. Word has length 144 [2019-09-16 17:06:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,419 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 604 transitions. [2019-09-16 17:06:02,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 604 transitions. [2019-09-16 17:06:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:06:02,420 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,420 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,421 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1833376945, now seen corresponding path program 1 times [2019-09-16 17:06:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,485 INFO L87 Difference]: Start difference. First operand 402 states and 604 transitions. Second operand 4 states. [2019-09-16 17:06:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,970 INFO L93 Difference]: Finished difference Result 484 states and 728 transitions. [2019-09-16 17:06:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:06:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,973 INFO L225 Difference]: With dead ends: 484 [2019-09-16 17:06:02,973 INFO L226 Difference]: Without dead ends: 484 [2019-09-16 17:06:02,974 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-16 17:06:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2019-09-16 17:06:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 603 transitions. [2019-09-16 17:06:02,978 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 603 transitions. Word has length 145 [2019-09-16 17:06:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,978 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 603 transitions. [2019-09-16 17:06:02,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 603 transitions. [2019-09-16 17:06:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 17:06:02,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,980 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,980 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1213278688, now seen corresponding path program 1 times [2019-09-16 17:06:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:03,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,043 INFO L87 Difference]: Start difference. First operand 402 states and 603 transitions. Second operand 4 states. [2019-09-16 17:06:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,503 INFO L93 Difference]: Finished difference Result 474 states and 715 transitions. [2019-09-16 17:06:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 17:06:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,507 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:06:03,507 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:06:03,507 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:06:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 387. [2019-09-16 17:06:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-16 17:06:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 582 transitions. [2019-09-16 17:06:03,512 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 582 transitions. Word has length 146 [2019-09-16 17:06:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,512 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 582 transitions. [2019-09-16 17:06:03,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 582 transitions. [2019-09-16 17:06:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-16 17:06:03,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,514 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:03,514 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 97670747, now seen corresponding path program 1 times [2019-09-16 17:06:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,593 INFO L87 Difference]: Start difference. First operand 387 states and 582 transitions. Second operand 4 states. [2019-09-16 17:06:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,014 INFO L93 Difference]: Finished difference Result 474 states and 714 transitions. [2019-09-16 17:06:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-16 17:06:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,018 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:06:04,018 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:06:04,018 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:06:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 415. [2019-09-16 17:06:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-16 17:06:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2019-09-16 17:06:04,023 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 148 [2019-09-16 17:06:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,023 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2019-09-16 17:06:04,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2019-09-16 17:06:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:06:04,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,024 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,024 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1333782526, now seen corresponding path program 1 times [2019-09-16 17:06:04,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,077 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,459 INFO L93 Difference]: Finished difference Result 466 states and 700 transitions. [2019-09-16 17:06:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:06:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,462 INFO L225 Difference]: With dead ends: 466 [2019-09-16 17:06:04,462 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 17:06:04,462 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 17:06:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 416. [2019-09-16 17:06:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-16 17:06:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2019-09-16 17:06:04,467 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 149 [2019-09-16 17:06:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,467 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2019-09-16 17:06:04,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2019-09-16 17:06:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-16 17:06:04,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,469 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,469 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash -722547992, now seen corresponding path program 1 times [2019-09-16 17:06:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:04,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,520 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,907 INFO L93 Difference]: Finished difference Result 466 states and 699 transitions. [2019-09-16 17:06:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-16 17:06:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,910 INFO L225 Difference]: With dead ends: 466 [2019-09-16 17:06:04,910 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 17:06:04,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 17:06:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 416. [2019-09-16 17:06:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-16 17:06:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2019-09-16 17:06:04,916 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 151 [2019-09-16 17:06:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,916 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2019-09-16 17:06:04,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2019-09-16 17:06:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:04,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,917 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,917 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 60551523, now seen corresponding path program 1 times [2019-09-16 17:06:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,981 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,366 INFO L93 Difference]: Finished difference Result 463 states and 694 transitions. [2019-09-16 17:06:05,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,371 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:06:05,371 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:06:05,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:06:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2019-09-16 17:06:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 632 transitions. [2019-09-16 17:06:05,376 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 632 transitions. Word has length 152 [2019-09-16 17:06:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,376 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 632 transitions. [2019-09-16 17:06:05,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2019-09-16 17:06:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:05,377 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,377 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,377 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -224479707, now seen corresponding path program 1 times [2019-09-16 17:06:05,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:05,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,441 INFO L87 Difference]: Start difference. First operand 419 states and 632 transitions. Second operand 4 states. [2019-09-16 17:06:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,804 INFO L93 Difference]: Finished difference Result 461 states and 691 transitions. [2019-09-16 17:06:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,808 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:05,808 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:05,810 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 419. [2019-09-16 17:06:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 631 transitions. [2019-09-16 17:06:05,816 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 631 transitions. Word has length 152 [2019-09-16 17:06:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,817 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 631 transitions. [2019-09-16 17:06:05,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 631 transitions. [2019-09-16 17:06:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:05,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,818 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] [2019-09-16 17:06:05,818 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1555697401, now seen corresponding path program 1 times [2019-09-16 17:06:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,877 INFO L87 Difference]: Start difference. First operand 419 states and 631 transitions. Second operand 4 states. [2019-09-16 17:06:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,259 INFO L93 Difference]: Finished difference Result 453 states and 676 transitions. [2019-09-16 17:06:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,263 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:06:06,263 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:06:06,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:06:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2019-09-16 17:06:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 630 transitions. [2019-09-16 17:06:06,269 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 630 transitions. Word has length 152 [2019-09-16 17:06:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,269 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 630 transitions. [2019-09-16 17:06:06,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 630 transitions. [2019-09-16 17:06:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:06,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,271 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:06,271 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2127838012, now seen corresponding path program 1 times [2019-09-16 17:06:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:06,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:06,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,346 INFO L87 Difference]: Start difference. First operand 419 states and 630 transitions. Second operand 4 states. [2019-09-16 17:06:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,796 INFO L93 Difference]: Finished difference Result 474 states and 708 transitions. [2019-09-16 17:06:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,801 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:06:06,801 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:06:06,801 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:06:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 419. [2019-09-16 17:06:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 629 transitions. [2019-09-16 17:06:06,808 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 629 transitions. Word has length 153 [2019-09-16 17:06:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,808 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 629 transitions. [2019-09-16 17:06:06,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 629 transitions. [2019-09-16 17:06:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:06,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,810 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] [2019-09-16 17:06:06,810 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash 665842924, now seen corresponding path program 1 times [2019-09-16 17:06:06,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:06,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:06,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,883 INFO L87 Difference]: Start difference. First operand 419 states and 629 transitions. Second operand 4 states. [2019-09-16 17:06:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:07,230 INFO L93 Difference]: Finished difference Result 453 states and 674 transitions. [2019-09-16 17:06:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:07,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:07,233 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:06:07,233 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:06:07,233 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:06:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2019-09-16 17:06:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 628 transitions. [2019-09-16 17:06:07,239 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 628 transitions. Word has length 153 [2019-09-16 17:06:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:07,239 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 628 transitions. [2019-09-16 17:06:07,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2019-09-16 17:06:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:07,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,240 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:07,240 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1062487733, now seen corresponding path program 1 times [2019-09-16 17:06:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:07,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,298 INFO L87 Difference]: Start difference. First operand 419 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:07,712 INFO L93 Difference]: Finished difference Result 466 states and 693 transitions. [2019-09-16 17:06:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:07,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:07,714 INFO L225 Difference]: With dead ends: 466 [2019-09-16 17:06:07,714 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 17:06:07,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 17:06:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 419. [2019-09-16 17:06:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 627 transitions. [2019-09-16 17:06:07,721 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 627 transitions. Word has length 154 [2019-09-16 17:06:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:07,721 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 627 transitions. [2019-09-16 17:06:07,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 627 transitions. [2019-09-16 17:06:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:07,722 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,723 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:07,723 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash -490971647, now seen corresponding path program 1 times [2019-09-16 17:06:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:07,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,781 INFO L87 Difference]: Start difference. First operand 419 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,162 INFO L93 Difference]: Finished difference Result 461 states and 686 transitions. [2019-09-16 17:06:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,164 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:08,164 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:08,165 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 420. [2019-09-16 17:06:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-16 17:06:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 628 transitions. [2019-09-16 17:06:08,172 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 628 transitions. Word has length 154 [2019-09-16 17:06:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,172 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 628 transitions. [2019-09-16 17:06:08,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 628 transitions. [2019-09-16 17:06:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:08,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,174 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] [2019-09-16 17:06:08,174 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 114920606, now seen corresponding path program 1 times [2019-09-16 17:06:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,224 INFO L87 Difference]: Start difference. First operand 420 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,598 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-16 17:06:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,600 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:06:08,600 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:06:08,600 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:06:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 420. [2019-09-16 17:06:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-16 17:06:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2019-09-16 17:06:08,606 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 154 [2019-09-16 17:06:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,606 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2019-09-16 17:06:08,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2019-09-16 17:06:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:08,607 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,607 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:08,608 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1624654785, now seen corresponding path program 1 times [2019-09-16 17:06:08,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,676 INFO L87 Difference]: Start difference. First operand 420 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,032 INFO L93 Difference]: Finished difference Result 457 states and 679 transitions. [2019-09-16 17:06:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,034 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:09,034 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:09,034 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-16 17:06:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:06:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-16 17:06:09,040 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 155 [2019-09-16 17:06:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,040 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-16 17:06:09,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-16 17:06:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:09,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,041 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:09,041 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -356908402, now seen corresponding path program 1 times [2019-09-16 17:06:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:09,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,119 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,494 INFO L93 Difference]: Finished difference Result 457 states and 678 transitions. [2019-09-16 17:06:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,496 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:09,496 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:09,496 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2019-09-16 17:06:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 629 transitions. [2019-09-16 17:06:09,502 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 629 transitions. Word has length 155 [2019-09-16 17:06:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,502 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 629 transitions. [2019-09-16 17:06:09,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 629 transitions. [2019-09-16 17:06:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:09,503 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,503 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] [2019-09-16 17:06:09,504 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1480960625, now seen corresponding path program 1 times [2019-09-16 17:06:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:09,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,555 INFO L87 Difference]: Start difference. First operand 422 states and 629 transitions. Second operand 4 states. [2019-09-16 17:06:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,912 INFO L93 Difference]: Finished difference Result 446 states and 662 transitions. [2019-09-16 17:06:09,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,915 INFO L225 Difference]: With dead ends: 446 [2019-09-16 17:06:09,915 INFO L226 Difference]: Without dead ends: 446 [2019-09-16 17:06:09,915 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-16 17:06:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 422. [2019-09-16 17:06:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 628 transitions. [2019-09-16 17:06:09,921 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 628 transitions. Word has length 155 [2019-09-16 17:06:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,921 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 628 transitions. [2019-09-16 17:06:09,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 628 transitions. [2019-09-16 17:06:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:09,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,922 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:09,923 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash 556160991, now seen corresponding path program 1 times [2019-09-16 17:06:09,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:09,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,001 INFO L87 Difference]: Start difference. First operand 422 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,417 INFO L93 Difference]: Finished difference Result 466 states and 687 transitions. [2019-09-16 17:06:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,419 INFO L225 Difference]: With dead ends: 466 [2019-09-16 17:06:10,420 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 17:06:10,420 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 17:06:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 422. [2019-09-16 17:06:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 627 transitions. [2019-09-16 17:06:10,426 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 627 transitions. Word has length 156 [2019-09-16 17:06:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,427 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 627 transitions. [2019-09-16 17:06:10,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 627 transitions. [2019-09-16 17:06:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:10,428 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,428 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:10,429 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1609347920, now seen corresponding path program 1 times [2019-09-16 17:06:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:10,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,492 INFO L87 Difference]: Start difference. First operand 422 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,861 INFO L93 Difference]: Finished difference Result 455 states and 673 transitions. [2019-09-16 17:06:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,864 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:06:10,864 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:06:10,864 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:06:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 423. [2019-09-16 17:06:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-16 17:06:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 628 transitions. [2019-09-16 17:06:10,870 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 628 transitions. Word has length 156 [2019-09-16 17:06:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 628 transitions. [2019-09-16 17:06:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2019-09-16 17:06:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:10,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,871 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:10,871 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1045824332, now seen corresponding path program 1 times [2019-09-16 17:06:10,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:10,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,954 INFO L87 Difference]: Start difference. First operand 423 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,332 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-16 17:06:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,334 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:06:11,335 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:06:11,335 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:06:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 423. [2019-09-16 17:06:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-16 17:06:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 627 transitions. [2019-09-16 17:06:11,341 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 627 transitions. Word has length 157 [2019-09-16 17:06:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,342 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 627 transitions. [2019-09-16 17:06:11,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 627 transitions. [2019-09-16 17:06:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:11,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,343 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:11,343 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash 760793102, now seen corresponding path program 1 times [2019-09-16 17:06:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,398 INFO L87 Difference]: Start difference. First operand 423 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,772 INFO L93 Difference]: Finished difference Result 461 states and 678 transitions. [2019-09-16 17:06:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,774 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:11,774 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:11,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 423. [2019-09-16 17:06:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-16 17:06:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2019-09-16 17:06:11,781 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 157 [2019-09-16 17:06:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,781 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2019-09-16 17:06:11,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2019-09-16 17:06:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:11,783 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,783 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:11,783 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash 903640755, now seen corresponding path program 1 times [2019-09-16 17:06:11,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,854 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand 4 states. [2019-09-16 17:06:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,203 INFO L93 Difference]: Finished difference Result 455 states and 670 transitions. [2019-09-16 17:06:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,205 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:06:12,205 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:06:12,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:06:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 424. [2019-09-16 17:06:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-16 17:06:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 627 transitions. [2019-09-16 17:06:12,212 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 627 transitions. Word has length 157 [2019-09-16 17:06:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,212 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 627 transitions. [2019-09-16 17:06:12,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 627 transitions. [2019-09-16 17:06:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:12,213 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,213 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:12,214 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash -567893771, now seen corresponding path program 1 times [2019-09-16 17:06:12,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:12,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,280 INFO L87 Difference]: Start difference. First operand 424 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,636 INFO L93 Difference]: Finished difference Result 453 states and 667 transitions. [2019-09-16 17:06:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,638 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:06:12,639 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:06:12,639 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:06:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 425. [2019-09-16 17:06:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 628 transitions. [2019-09-16 17:06:12,643 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 628 transitions. Word has length 158 [2019-09-16 17:06:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,643 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 628 transitions. [2019-09-16 17:06:12,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 628 transitions. [2019-09-16 17:06:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:12,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,644 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:12,645 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1463392682, now seen corresponding path program 1 times [2019-09-16 17:06:12,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:12,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,701 INFO L87 Difference]: Start difference. First operand 425 states and 628 transitions. Second operand 4 states. [2019-09-16 17:06:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,068 INFO L93 Difference]: Finished difference Result 461 states and 675 transitions. [2019-09-16 17:06:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,070 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:13,070 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:13,070 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2019-09-16 17:06:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 627 transitions. [2019-09-16 17:06:13,075 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 627 transitions. Word has length 159 [2019-09-16 17:06:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,075 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 627 transitions. [2019-09-16 17:06:13,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 627 transitions. [2019-09-16 17:06:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:13,076 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,077 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,077 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1168902730, now seen corresponding path program 1 times [2019-09-16 17:06:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,137 INFO L87 Difference]: Start difference. First operand 425 states and 627 transitions. Second operand 4 states. [2019-09-16 17:06:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,507 INFO L93 Difference]: Finished difference Result 457 states and 669 transitions. [2019-09-16 17:06:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,510 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:13,510 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:13,510 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 425. [2019-09-16 17:06:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 626 transitions. [2019-09-16 17:06:13,516 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 626 transitions. Word has length 160 [2019-09-16 17:06:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,516 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 626 transitions. [2019-09-16 17:06:13,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 626 transitions. [2019-09-16 17:06:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:13,517 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,517 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,518 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,518 INFO L82 PathProgramCache]: Analyzing trace with hash 98843653, now seen corresponding path program 1 times [2019-09-16 17:06:13,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:13,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,604 INFO L87 Difference]: Start difference. First operand 425 states and 626 transitions. Second operand 4 states. [2019-09-16 17:06:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,986 INFO L93 Difference]: Finished difference Result 457 states and 668 transitions. [2019-09-16 17:06:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,988 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:13,988 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:13,989 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 425. [2019-09-16 17:06:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 625 transitions. [2019-09-16 17:06:13,992 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 625 transitions. Word has length 160 [2019-09-16 17:06:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,993 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 625 transitions. [2019-09-16 17:06:13,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 625 transitions. [2019-09-16 17:06:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:06:13,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,995 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,995 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash -365936103, now seen corresponding path program 1 times [2019-09-16 17:06:13,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,049 INFO L87 Difference]: Start difference. First operand 425 states and 625 transitions. Second operand 4 states. [2019-09-16 17:06:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,432 INFO L93 Difference]: Finished difference Result 455 states and 665 transitions. [2019-09-16 17:06:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:06:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,434 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:06:14,434 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:06:14,435 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:06:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 425. [2019-09-16 17:06:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2019-09-16 17:06:14,439 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 161 [2019-09-16 17:06:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,439 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2019-09-16 17:06:14,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2019-09-16 17:06:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:14,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,441 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:14,441 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash 794701418, now seen corresponding path program 1 times [2019-09-16 17:06:14,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:14,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,515 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand 4 states. [2019-09-16 17:06:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,887 INFO L93 Difference]: Finished difference Result 455 states and 664 transitions. [2019-09-16 17:06:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,889 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:06:14,889 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:06:14,890 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:06:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 425. [2019-09-16 17:06:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 623 transitions. [2019-09-16 17:06:14,894 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 623 transitions. Word has length 162 [2019-09-16 17:06:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,895 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 623 transitions. [2019-09-16 17:06:14,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 623 transitions. [2019-09-16 17:06:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:14,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,896 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] [2019-09-16 17:06:14,896 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1011765485, now seen corresponding path program 1 times [2019-09-16 17:06:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,993 INFO L87 Difference]: Start difference. First operand 425 states and 623 transitions. Second operand 4 states. [2019-09-16 17:06:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,394 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2019-09-16 17:06:15,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,397 INFO L225 Difference]: With dead ends: 491 [2019-09-16 17:06:15,397 INFO L226 Difference]: Without dead ends: 491 [2019-09-16 17:06:15,397 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-16 17:06:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 455. [2019-09-16 17:06:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-16 17:06:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2019-09-16 17:06:15,404 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 162 [2019-09-16 17:06:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,405 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2019-09-16 17:06:15,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2019-09-16 17:06:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:15,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,406 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:15,407 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 349954078, now seen corresponding path program 1 times [2019-09-16 17:06:15,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:15,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,505 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2019-09-16 17:06:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,905 INFO L93 Difference]: Finished difference Result 483 states and 714 transitions. [2019-09-16 17:06:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,907 INFO L225 Difference]: With dead ends: 483 [2019-09-16 17:06:15,907 INFO L226 Difference]: Without dead ends: 483 [2019-09-16 17:06:15,908 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-16 17:06:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 417. [2019-09-16 17:06:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:06:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2019-09-16 17:06:15,914 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 163 [2019-09-16 17:06:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,914 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2019-09-16 17:06:15,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2019-09-16 17:06:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:06:15,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,915 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:15,915 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2310629, now seen corresponding path program 1 times [2019-09-16 17:06:15,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,972 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2019-09-16 17:06:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,345 INFO L93 Difference]: Finished difference Result 483 states and 713 transitions. [2019-09-16 17:06:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:06:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,347 INFO L225 Difference]: With dead ends: 483 [2019-09-16 17:06:16,347 INFO L226 Difference]: Without dead ends: 483 [2019-09-16 17:06:16,348 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-16 17:06:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 447. [2019-09-16 17:06:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-16 17:06:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 665 transitions. [2019-09-16 17:06:16,353 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 665 transitions. Word has length 165 [2019-09-16 17:06:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,353 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 665 transitions. [2019-09-16 17:06:16,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 665 transitions. [2019-09-16 17:06:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:06:16,354 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,354 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:16,355 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2130974512, now seen corresponding path program 1 times [2019-09-16 17:06:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:16,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,409 INFO L87 Difference]: Start difference. First operand 447 states and 665 transitions. Second operand 4 states. [2019-09-16 17:06:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,821 INFO L93 Difference]: Finished difference Result 486 states and 716 transitions. [2019-09-16 17:06:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:06:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,825 INFO L225 Difference]: With dead ends: 486 [2019-09-16 17:06:16,825 INFO L226 Difference]: Without dead ends: 486 [2019-09-16 17:06:16,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-16 17:06:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 447. [2019-09-16 17:06:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-16 17:06:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 664 transitions. [2019-09-16 17:06:16,830 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 664 transitions. Word has length 165 [2019-09-16 17:06:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,831 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 664 transitions. [2019-09-16 17:06:16,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 664 transitions. [2019-09-16 17:06:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:16,832 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,833 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, 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] [2019-09-16 17:06:16,833 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2071104971, now seen corresponding path program 1 times [2019-09-16 17:06:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-16 17:06:16,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,907 INFO L87 Difference]: Start difference. First operand 447 states and 664 transitions. Second operand 4 states. [2019-09-16 17:06:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,166 INFO L93 Difference]: Finished difference Result 460 states and 681 transitions. [2019-09-16 17:06:17,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,168 INFO L225 Difference]: With dead ends: 460 [2019-09-16 17:06:17,168 INFO L226 Difference]: Without dead ends: 460 [2019-09-16 17:06:17,168 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-16 17:06:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 447. [2019-09-16 17:06:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-16 17:06:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 663 transitions. [2019-09-16 17:06:17,176 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 663 transitions. Word has length 166 [2019-09-16 17:06:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,176 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 663 transitions. [2019-09-16 17:06:17,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 663 transitions. [2019-09-16 17:06:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:17,178 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,180 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,180 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1319564181, now seen corresponding path program 1 times [2019-09-16 17:06:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:17,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,266 INFO L87 Difference]: Start difference. First operand 447 states and 663 transitions. Second operand 4 states. [2019-09-16 17:06:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,638 INFO L93 Difference]: Finished difference Result 486 states and 714 transitions. [2019-09-16 17:06:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,640 INFO L225 Difference]: With dead ends: 486 [2019-09-16 17:06:17,640 INFO L226 Difference]: Without dead ends: 486 [2019-09-16 17:06:17,640 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-16 17:06:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 447. [2019-09-16 17:06:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-16 17:06:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 662 transitions. [2019-09-16 17:06:17,649 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 662 transitions. Word has length 166 [2019-09-16 17:06:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,649 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 662 transitions. [2019-09-16 17:06:17,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 662 transitions. [2019-09-16 17:06:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:17,651 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,651 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,651 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1094556907, now seen corresponding path program 1 times [2019-09-16 17:06:17,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:06:17,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,722 INFO L87 Difference]: Start difference. First operand 447 states and 662 transitions. Second operand 4 states. [2019-09-16 17:06:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,025 INFO L93 Difference]: Finished difference Result 471 states and 695 transitions. [2019-09-16 17:06:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-16 17:06:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,027 INFO L225 Difference]: With dead ends: 471 [2019-09-16 17:06:18,027 INFO L226 Difference]: Without dead ends: 471 [2019-09-16 17:06:18,027 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-16 17:06:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 447. [2019-09-16 17:06:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-16 17:06:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 661 transitions. [2019-09-16 17:06:18,035 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 661 transitions. Word has length 167 [2019-09-16 17:06:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,036 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 661 transitions. [2019-09-16 17:06:18,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 661 transitions. [2019-09-16 17:06:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:18,038 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,039 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] [2019-09-16 17:06:18,039 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1858944018, now seen corresponding path program 1 times [2019-09-16 17:06:18,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:18,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:18,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,198 INFO L87 Difference]: Start difference. First operand 447 states and 661 transitions. Second operand 5 states. [2019-09-16 17:06:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,828 INFO L93 Difference]: Finished difference Result 523 states and 777 transitions. [2019-09-16 17:06:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:06:18,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-09-16 17:06:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,831 INFO L225 Difference]: With dead ends: 523 [2019-09-16 17:06:18,831 INFO L226 Difference]: Without dead ends: 523 [2019-09-16 17:06:18,832 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-16 17:06:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 480. [2019-09-16 17:06:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-16 17:06:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 720 transitions. [2019-09-16 17:06:18,838 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 720 transitions. Word has length 167 [2019-09-16 17:06:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,838 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 720 transitions. [2019-09-16 17:06:18,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 720 transitions. [2019-09-16 17:06:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-16 17:06:18,839 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,839 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:18,839 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2057897858, now seen corresponding path program 1 times [2019-09-16 17:06:18,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:06:18,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,911 INFO L87 Difference]: Start difference. First operand 480 states and 720 transitions. Second operand 4 states. [2019-09-16 17:06:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,284 INFO L93 Difference]: Finished difference Result 502 states and 751 transitions. [2019-09-16 17:06:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-16 17:06:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,286 INFO L225 Difference]: With dead ends: 502 [2019-09-16 17:06:19,287 INFO L226 Difference]: Without dead ends: 502 [2019-09-16 17:06:19,287 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-16 17:06:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 480. [2019-09-16 17:06:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-16 17:06:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 719 transitions. [2019-09-16 17:06:19,293 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 719 transitions. Word has length 168 [2019-09-16 17:06:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,294 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 719 transitions. [2019-09-16 17:06:19,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 719 transitions. [2019-09-16 17:06:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-16 17:06:19,295 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,295 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,296 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash -863405986, now seen corresponding path program 1 times [2019-09-16 17:06:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-16 17:06:19,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:19,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:19,369 INFO L87 Difference]: Start difference. First operand 480 states and 719 transitions. Second operand 3 states. [2019-09-16 17:06:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,418 INFO L93 Difference]: Finished difference Result 928 states and 1393 transitions. [2019-09-16 17:06:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:19,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-16 17:06:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,420 INFO L225 Difference]: With dead ends: 928 [2019-09-16 17:06:19,420 INFO L226 Difference]: Without dead ends: 928 [2019-09-16 17:06:19,421 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-16 17:06:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2019-09-16 17:06:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-09-16 17:06:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1393 transitions. [2019-09-16 17:06:19,435 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1393 transitions. Word has length 171 [2019-09-16 17:06:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,435 INFO L475 AbstractCegarLoop]: Abstraction has 928 states and 1393 transitions. [2019-09-16 17:06:19,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1393 transitions. [2019-09-16 17:06:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-16 17:06:19,437 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,437 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,437 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 742814593, now seen corresponding path program 1 times [2019-09-16 17:06:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:06:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,582 INFO L87 Difference]: Start difference. First operand 928 states and 1393 transitions. Second operand 4 states. [2019-09-16 17:06:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,937 INFO L93 Difference]: Finished difference Result 1000 states and 1482 transitions. [2019-09-16 17:06:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-16 17:06:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,940 INFO L225 Difference]: With dead ends: 1000 [2019-09-16 17:06:19,940 INFO L226 Difference]: Without dead ends: 1000 [2019-09-16 17:06:19,940 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-09-16 17:06:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 868. [2019-09-16 17:06:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-16 17:06:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1301 transitions. [2019-09-16 17:06:19,947 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1301 transitions. Word has length 172 [2019-09-16 17:06:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,947 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1301 transitions. [2019-09-16 17:06:19,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1301 transitions. [2019-09-16 17:06:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-16 17:06:19,949 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,949 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,949 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1219457622, now seen corresponding path program 1 times [2019-09-16 17:06:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:20,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:20,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:20,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,008 INFO L87 Difference]: Start difference. First operand 868 states and 1301 transitions. Second operand 3 states. [2019-09-16 17:06:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,055 INFO L93 Difference]: Finished difference Result 1284 states and 1925 transitions. [2019-09-16 17:06:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:20,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-16 17:06:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,058 INFO L225 Difference]: With dead ends: 1284 [2019-09-16 17:06:20,058 INFO L226 Difference]: Without dead ends: 1284 [2019-09-16 17:06:20,059 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-16 17:06:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-09-16 17:06:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-09-16 17:06:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1924 transitions. [2019-09-16 17:06:20,071 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1924 transitions. Word has length 172 [2019-09-16 17:06:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,071 INFO L475 AbstractCegarLoop]: Abstraction has 1282 states and 1924 transitions. [2019-09-16 17:06:20,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1924 transitions. [2019-09-16 17:06:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:20,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,072 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,072 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash -575826608, now seen corresponding path program 1 times [2019-09-16 17:06:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:06:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,154 INFO L87 Difference]: Start difference. First operand 1282 states and 1924 transitions. Second operand 4 states. [2019-09-16 17:06:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,499 INFO L93 Difference]: Finished difference Result 1471 states and 2181 transitions. [2019-09-16 17:06:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-16 17:06:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,501 INFO L225 Difference]: With dead ends: 1471 [2019-09-16 17:06:20,501 INFO L226 Difference]: Without dead ends: 1471 [2019-09-16 17:06:20,502 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-09-16 17:06:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1375. [2019-09-16 17:06:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-09-16 17:06:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2062 transitions. [2019-09-16 17:06:20,512 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2062 transitions. Word has length 173 [2019-09-16 17:06:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,512 INFO L475 AbstractCegarLoop]: Abstraction has 1375 states and 2062 transitions. [2019-09-16 17:06:20,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2062 transitions. [2019-09-16 17:06:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:20,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,513 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,514 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1265547902, now seen corresponding path program 1 times [2019-09-16 17:06:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-16 17:06:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:20,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,579 INFO L87 Difference]: Start difference. First operand 1375 states and 2062 transitions. Second operand 3 states. [2019-09-16 17:06:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,625 INFO L93 Difference]: Finished difference Result 1792 states and 2688 transitions. [2019-09-16 17:06:20,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:20,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-16 17:06:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,628 INFO L225 Difference]: With dead ends: 1792 [2019-09-16 17:06:20,628 INFO L226 Difference]: Without dead ends: 1792 [2019-09-16 17:06:20,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2019-09-16 17:06:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1787. [2019-09-16 17:06:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2019-09-16 17:06:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2684 transitions. [2019-09-16 17:06:20,653 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2684 transitions. Word has length 173 [2019-09-16 17:06:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,653 INFO L475 AbstractCegarLoop]: Abstraction has 1787 states and 2684 transitions. [2019-09-16 17:06:20,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2684 transitions. [2019-09-16 17:06:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:20,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,657 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,658 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1850319552, now seen corresponding path program 1 times [2019-09-16 17:06:20,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-16 17:06:20,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:20,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,734 INFO L87 Difference]: Start difference. First operand 1787 states and 2684 transitions. Second operand 3 states. [2019-09-16 17:06:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,790 INFO L93 Difference]: Finished difference Result 1814 states and 2719 transitions. [2019-09-16 17:06:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:20,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-16 17:06:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,794 INFO L225 Difference]: With dead ends: 1814 [2019-09-16 17:06:20,794 INFO L226 Difference]: Without dead ends: 1814 [2019-09-16 17:06:20,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-16 17:06:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-16 17:06:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2019-09-16 17:06:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-09-16 17:06:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2719 transitions. [2019-09-16 17:06:20,823 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2719 transitions. Word has length 173 [2019-09-16 17:06:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,823 INFO L475 AbstractCegarLoop]: Abstraction has 1814 states and 2719 transitions. [2019-09-16 17:06:20,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2719 transitions. [2019-09-16 17:06:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:20,827 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,828 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,828 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2114967042, now seen corresponding path program 1 times [2019-09-16 17:06:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-16 17:06:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:20,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,903 INFO L87 Difference]: Start difference. First operand 1814 states and 2719 transitions. Second operand 3 states. [2019-09-16 17:06:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,944 INFO L93 Difference]: Finished difference Result 1816 states and 2721 transitions. [2019-09-16 17:06:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:20,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-16 17:06:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,948 INFO L225 Difference]: With dead ends: 1816 [2019-09-16 17:06:20,948 INFO L226 Difference]: Without dead ends: 1816 [2019-09-16 17:06:20,949 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-16 17:06:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2019-09-16 17:06:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2721 transitions. [2019-09-16 17:06:20,977 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2721 transitions. Word has length 173 [2019-09-16 17:06:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,977 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2721 transitions. [2019-09-16 17:06:20,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2721 transitions. [2019-09-16 17:06:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-16 17:06:20,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,980 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,980 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1659458131, now seen corresponding path program 1 times [2019-09-16 17:06:20,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:21,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,101 INFO L87 Difference]: Start difference. First operand 1816 states and 2721 transitions. Second operand 4 states. [2019-09-16 17:06:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,491 INFO L93 Difference]: Finished difference Result 1961 states and 2904 transitions. [2019-09-16 17:06:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-16 17:06:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,494 INFO L225 Difference]: With dead ends: 1961 [2019-09-16 17:06:21,494 INFO L226 Difference]: Without dead ends: 1961 [2019-09-16 17:06:21,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-09-16 17:06:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2019-09-16 17:06:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2717 transitions. [2019-09-16 17:06:21,507 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2717 transitions. Word has length 177 [2019-09-16 17:06:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,508 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2717 transitions. [2019-09-16 17:06:21,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2717 transitions. [2019-09-16 17:06:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-16 17:06:21,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,509 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,509 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -412541742, now seen corresponding path program 1 times [2019-09-16 17:06:21,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,578 INFO L87 Difference]: Start difference. First operand 1816 states and 2717 transitions. Second operand 4 states. [2019-09-16 17:06:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,966 INFO L93 Difference]: Finished difference Result 1961 states and 2900 transitions. [2019-09-16 17:06:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-16 17:06:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,969 INFO L225 Difference]: With dead ends: 1961 [2019-09-16 17:06:21,969 INFO L226 Difference]: Without dead ends: 1961 [2019-09-16 17:06:21,969 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-09-16 17:06:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2019-09-16 17:06:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2713 transitions. [2019-09-16 17:06:21,990 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2713 transitions. Word has length 178 [2019-09-16 17:06:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,991 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2713 transitions. [2019-09-16 17:06:21,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2713 transitions. [2019-09-16 17:06:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-16 17:06:21,993 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,993 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,993 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1044734328, now seen corresponding path program 1 times [2019-09-16 17:06:21,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:22,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,133 INFO L87 Difference]: Start difference. First operand 1816 states and 2713 transitions. Second operand 4 states. [2019-09-16 17:06:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,505 INFO L93 Difference]: Finished difference Result 1961 states and 2896 transitions. [2019-09-16 17:06:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-16 17:06:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,508 INFO L225 Difference]: With dead ends: 1961 [2019-09-16 17:06:22,508 INFO L226 Difference]: Without dead ends: 1961 [2019-09-16 17:06:22,508 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-09-16 17:06:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2019-09-16 17:06:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2709 transitions. [2019-09-16 17:06:22,528 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2709 transitions. Word has length 179 [2019-09-16 17:06:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,528 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2709 transitions. [2019-09-16 17:06:22,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2709 transitions. [2019-09-16 17:06:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 17:06:22,530 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,531 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,531 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,531 INFO L82 PathProgramCache]: Analyzing trace with hash 240414935, now seen corresponding path program 1 times [2019-09-16 17:06:22,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,607 INFO L87 Difference]: Start difference. First operand 1816 states and 2709 transitions. Second operand 4 states. [2019-09-16 17:06:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,961 INFO L93 Difference]: Finished difference Result 1921 states and 2844 transitions. [2019-09-16 17:06:22,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-16 17:06:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,964 INFO L225 Difference]: With dead ends: 1921 [2019-09-16 17:06:22,964 INFO L226 Difference]: Without dead ends: 1921 [2019-09-16 17:06:22,964 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-09-16 17:06:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1816. [2019-09-16 17:06:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2705 transitions. [2019-09-16 17:06:22,977 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2705 transitions. Word has length 180 [2019-09-16 17:06:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,978 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2705 transitions. [2019-09-16 17:06:22,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2705 transitions. [2019-09-16 17:06:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-16 17:06:22,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,979 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,979 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash 873482100, now seen corresponding path program 1 times [2019-09-16 17:06:22,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:23,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,103 INFO L87 Difference]: Start difference. First operand 1816 states and 2705 transitions. Second operand 4 states. [2019-09-16 17:06:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,541 INFO L93 Difference]: Finished difference Result 1989 states and 2924 transitions. [2019-09-16 17:06:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-16 17:06:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,544 INFO L225 Difference]: With dead ends: 1989 [2019-09-16 17:06:23,544 INFO L226 Difference]: Without dead ends: 1989 [2019-09-16 17:06:23,544 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-09-16 17:06:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1816. [2019-09-16 17:06:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-09-16 17:06:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2701 transitions. [2019-09-16 17:06:23,558 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2701 transitions. Word has length 182 [2019-09-16 17:06:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,558 INFO L475 AbstractCegarLoop]: Abstraction has 1816 states and 2701 transitions. [2019-09-16 17:06:23,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2701 transitions. [2019-09-16 17:06:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-16 17:06:23,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,560 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:23,560 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 992005073, now seen corresponding path program 1 times [2019-09-16 17:06:23,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-16 17:06:23,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:23,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:23,687 INFO L87 Difference]: Start difference. First operand 1816 states and 2701 transitions. Second operand 5 states. [2019-09-16 17:06:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,231 INFO L93 Difference]: Finished difference Result 2265 states and 3377 transitions. [2019-09-16 17:06:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-16 17:06:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,235 INFO L225 Difference]: With dead ends: 2265 [2019-09-16 17:06:24,235 INFO L226 Difference]: Without dead ends: 2265 [2019-09-16 17:06:24,235 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:06:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2019-09-16 17:06:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1975. [2019-09-16 17:06:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-09-16 17:06:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2988 transitions. [2019-09-16 17:06:24,250 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2988 transitions. Word has length 183 [2019-09-16 17:06:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,251 INFO L475 AbstractCegarLoop]: Abstraction has 1975 states and 2988 transitions. [2019-09-16 17:06:24,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2988 transitions. [2019-09-16 17:06:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-16 17:06:24,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,253 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,253 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 485901019, now seen corresponding path program 1 times [2019-09-16 17:06:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-16 17:06:24,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:24,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:24,388 INFO L87 Difference]: Start difference. First operand 1975 states and 2988 transitions. Second operand 5 states. [2019-09-16 17:06:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,906 INFO L93 Difference]: Finished difference Result 2377 states and 3597 transitions. [2019-09-16 17:06:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-16 17:06:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,909 INFO L225 Difference]: With dead ends: 2377 [2019-09-16 17:06:24,910 INFO L226 Difference]: Without dead ends: 2377 [2019-09-16 17:06:24,910 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:06:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-09-16 17:06:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2083. [2019-09-16 17:06:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-09-16 17:06:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3208 transitions. [2019-09-16 17:06:24,930 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3208 transitions. Word has length 184 [2019-09-16 17:06:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,930 INFO L475 AbstractCegarLoop]: Abstraction has 2083 states and 3208 transitions. [2019-09-16 17:06:24,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3208 transitions. [2019-09-16 17:06:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-16 17:06:24,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,952 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,953 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 834307115, now seen corresponding path program 1 times [2019-09-16 17:06:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-16 17:06:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,031 INFO L87 Difference]: Start difference. First operand 2083 states and 3208 transitions. Second operand 4 states. [2019-09-16 17:06:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,367 INFO L93 Difference]: Finished difference Result 2168 states and 3323 transitions. [2019-09-16 17:06:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-16 17:06:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,371 INFO L225 Difference]: With dead ends: 2168 [2019-09-16 17:06:25,372 INFO L226 Difference]: Without dead ends: 2168 [2019-09-16 17:06:25,372 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-09-16 17:06:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2083. [2019-09-16 17:06:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-09-16 17:06:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3204 transitions. [2019-09-16 17:06:25,386 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3204 transitions. Word has length 196 [2019-09-16 17:06:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,386 INFO L475 AbstractCegarLoop]: Abstraction has 2083 states and 3204 transitions. [2019-09-16 17:06:25,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3204 transitions. [2019-09-16 17:06:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-16 17:06:25,388 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,389 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash 279999318, now seen corresponding path program 1 times [2019-09-16 17:06:25,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 4 proven. 205 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:26,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:26,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:26,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2019-09-16 17:06:26,106 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [186], [188], [193], [198], [203], [208], [213], [218], [221], [312], [315], [323], [325], [328], [336], [341], [343], [345], [348], [357], [359], [362], [366], [369], [398], [403], [413], [415], [418], [429], [431], [441], [443], [448], [470], [472], [506], [511], [516], [613], [647], [649], [661], [664], [665], [677], [685], [686], [687] [2019-09-16 17:06:26,183 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:26,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:26,250 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:26,252 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:06:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,256 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:26,383 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:26,383 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:26,395 INFO L420 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2019-09-16 17:06:26,395 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:26,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:26,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2019-09-16 17:06:26,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:26,399 INFO L87 Difference]: Start difference. First operand 2083 states and 3204 transitions. Second operand 2 states. [2019-09-16 17:06:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,400 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:26,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 196 [2019-09-16 17:06:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,401 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:26,401 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:26,401 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:26,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 196 [2019-09-16 17:06:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,402 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:26,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:26,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:26,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:26 BoogieIcfgContainer [2019-09-16 17:06:26,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:26,423 INFO L168 Benchmark]: Toolchain (without parser) took 61453.31 ms. Allocated memory was 133.7 MB in the beginning and 737.7 MB in the end (delta: 604.0 MB). Free memory was 82.9 MB in the beginning and 365.9 MB in the end (delta: -283.0 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,424 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 891.67 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 82.7 MB in the beginning and 153.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,425 INFO L168 Benchmark]: Boogie Preprocessor took 183.96 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 145.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,426 INFO L168 Benchmark]: RCFGBuilder took 1667.25 ms. Allocated memory was 199.8 MB in the beginning and 220.2 MB in the end (delta: 20.4 MB). Free memory was 145.8 MB in the beginning and 162.4 MB in the end (delta: -16.6 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,426 INFO L168 Benchmark]: TraceAbstraction took 58705.30 ms. Allocated memory was 220.2 MB in the beginning and 737.7 MB in the end (delta: 517.5 MB). Free memory was 162.4 MB in the beginning and 365.9 MB in the end (delta: -203.5 MB). Peak memory consumption was 314.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:26,434 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 891.67 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 82.7 MB in the beginning and 153.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.96 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 145.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1667.25 ms. Allocated memory was 199.8 MB in the beginning and 220.2 MB in the end (delta: 20.4 MB). Free memory was 145.8 MB in the beginning and 162.4 MB in the end (delta: -16.6 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58705.30 ms. Allocated memory was 220.2 MB in the beginning and 737.7 MB in the end (delta: 517.5 MB). Free memory was 162.4 MB in the beginning and 365.9 MB in the end (delta: -203.5 MB). Peak memory consumption was 314.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 186 locations, 1 error locations. SAFE Result, 58.6s OverallTime, 121 OverallIterations, 7 TraceHistogramMax, 45.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27079 SDtfs, 7982 SDslu, 39152 SDs, 0 SdLazy, 24447 SolverSat, 1046 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 443 SyntacticMatches, 46 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2083occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.4205128205128206 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 121 MinimizatonAttempts, 5424 StatesRemovedByMinimization, 117 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 15711 NumberOfCodeBlocks, 15711 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 15590 ConstructedInterpolants, 0 QuantifiedInterpolants, 5227875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 121 InterpolantComputations, 120 PerfectInterpolantSequences, 16796/17001 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...