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.11.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:42,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:42,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:42,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:42,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:42,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:42,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:42,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:42,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:42,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:42,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:42,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:42,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:42,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:42,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:42,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:42,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:42,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:42,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:42,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:42,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:42,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:42,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:42,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:42,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:42,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:42,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:42,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:42,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:42,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:42,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:42,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:42,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:42,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:42,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:42,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:42,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:42,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:42,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:42,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:42,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:42,936 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:42,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:42,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:42,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:42,963 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:42,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:42,964 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:42,964 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:42,964 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:42,965 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:42,965 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:42,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:42,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:42,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:42,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:42,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:42,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:42,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:42,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:42,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:42,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:42,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:42,970 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:42,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:42,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:42,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:42,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:42,971 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:42,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:42,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:42,972 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:43,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:43,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:43,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:43,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:43,027 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:43,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.11.i.cil-2.c [2019-09-16 17:05:43,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260461e3/66b6590188114080a19f2414cb3b06ed/FLAG94cc4e167 [2019-09-16 17:05:43,769 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:43,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.11.i.cil-2.c [2019-09-16 17:05:43,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260461e3/66b6590188114080a19f2414cb3b06ed/FLAG94cc4e167 [2019-09-16 17:05:44,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3260461e3/66b6590188114080a19f2414cb3b06ed [2019-09-16 17:05:44,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:44,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:44,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:44,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:44,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:44,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:44" (1/1) ... [2019-09-16 17:05:44,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f458dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:44, skipping insertion in model container [2019-09-16 17:05:44,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:44" (1/1) ... [2019-09-16 17:05:44,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:44,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:44,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:44,713 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:44,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:44,935 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:44,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:44 WrapperNode [2019-09-16 17:05:44,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:44,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:44,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:44,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:44,953 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:44" (1/1) ... [2019-09-16 17:05:44,954 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:44" (1/1) ... [2019-09-16 17:05:44,998 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:44" (1/1) ... [2019-09-16 17:05:44,999 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:44" (1/1) ... [2019-09-16 17:05:45,086 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:44" (1/1) ... [2019-09-16 17:05:45,103 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:44" (1/1) ... [2019-09-16 17:05:45,112 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:44" (1/1) ... [2019-09-16 17:05:45,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:45,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:45,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:45,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:45,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:44" (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:45,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:45,260 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:45,260 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:45,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:45,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:45,967 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:46,826 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:46,826 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:46,848 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:46,848 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:46,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:46 BoogieIcfgContainer [2019-09-16 17:05:46,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:46,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:46,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:46,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:46,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:44" (1/3) ... [2019-09-16 17:05:46,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24953080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:46, skipping insertion in model container [2019-09-16 17:05:46,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:44" (2/3) ... [2019-09-16 17:05:46,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24953080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:46, skipping insertion in model container [2019-09-16 17:05:46,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:46" (3/3) ... [2019-09-16 17:05:46,858 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-2.c [2019-09-16 17:05:46,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:46,878 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:46,895 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:46,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:46,926 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:46,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:46,926 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:46,926 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:46,927 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:46,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:46,927 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-16 17:05:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 17:05:46,978 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:46,979 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] [2019-09-16 17:05:46,982 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1489368308, now seen corresponding path program 1 times [2019-09-16 17:05:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:47,421 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:47,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:47,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:47,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:47,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:47,449 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-16 17:05:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:47,902 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-16 17:05:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:47,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-16 17:05:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:47,919 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:05:47,919 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:47,921 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,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-16 17:05:47,990 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-16 17:05:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:47,991 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-16 17:05:47,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-16 17:05:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:05:47,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:47,995 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] [2019-09-16 17:05:47,995 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 380678987, now seen corresponding path program 1 times [2019-09-16 17:05:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:47,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,171 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:48,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,174 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-16 17:05:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:48,584 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-16 17:05:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:48,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-16 17:05:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:48,586 INFO L225 Difference]: With dead ends: 169 [2019-09-16 17:05:48,587 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:48,588 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,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-16 17:05:48,600 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-16 17:05:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:48,600 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-16 17:05:48,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-16 17:05:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:48,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:48,603 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] [2019-09-16 17:05:48,604 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1401722649, now seen corresponding path program 1 times [2019-09-16 17:05:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:48,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:48,773 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:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:48,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:48,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:48,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:48,775 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-16 17:05:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,076 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-16 17:05:49,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:49,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,079 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:05:49,079 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:05:49,080 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,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:05:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-16 17:05:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-16 17:05:49,096 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-16 17:05:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,096 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-16 17:05:49,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-16 17:05:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:49,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,099 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] [2019-09-16 17:05:49,099 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -536143493, now seen corresponding path program 1 times [2019-09-16 17:05:49,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,223 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:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:49,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:49,225 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-16 17:05:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:49,735 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-16 17:05:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:49,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-16 17:05:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:49,737 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:05:49,738 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:05:49,738 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:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:05:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-16 17:05:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-16 17:05:49,748 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-16 17:05:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:49,748 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-16 17:05:49,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-16 17:05:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:49,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:49,751 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] [2019-09-16 17:05:49,751 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:49,751 INFO L82 PathProgramCache]: Analyzing trace with hash -358032589, now seen corresponding path program 1 times [2019-09-16 17:05:49,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:49,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:49,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:49,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:49,849 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:49,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:49,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:49,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:49,853 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-16 17:05:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,151 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-16 17:05:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,153 INFO L225 Difference]: With dead ends: 187 [2019-09-16 17:05:50,154 INFO L226 Difference]: Without dead ends: 187 [2019-09-16 17:05:50,154 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,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-16 17:05:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-16 17:05:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-16 17:05:50,162 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-16 17:05:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,163 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-16 17:05:50,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-16 17:05:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:05:50,165 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,165 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] [2019-09-16 17:05:50,166 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1285498866, now seen corresponding path program 1 times [2019-09-16 17:05:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,267 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:50,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,269 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-16 17:05:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,530 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-16 17:05:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:05:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,532 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:50,532 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:50,533 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,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-16 17:05:50,539 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-16 17:05:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,540 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-16 17:05:50,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-16 17:05:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:05:50,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,547 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] [2019-09-16 17:05:50,547 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1797335240, now seen corresponding path program 1 times [2019-09-16 17:05:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:50,614 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:50,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:50,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:50,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:50,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:50,617 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-16 17:05:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:50,940 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-16 17:05:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:50,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-16 17:05:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:50,944 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:50,944 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:50,945 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-16 17:05:50,954 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-16 17:05:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:50,955 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-16 17:05:50,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-16 17:05:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-16 17:05:50,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:50,959 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] [2019-09-16 17:05:50,959 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1679814895, now seen corresponding path program 1 times [2019-09-16 17:05:50,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:50,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,053 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:51,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,057 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-16 17:05:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,331 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-16 17:05:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-16 17:05:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,334 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:51,334 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:51,335 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,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-16 17:05:51,341 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-16 17:05:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,341 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-16 17:05:51,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-16 17:05:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:51,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,343 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] [2019-09-16 17:05:51,343 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1049616899, now seen corresponding path program 1 times [2019-09-16 17:05:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,400 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:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,402 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-16 17:05:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:51,686 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-16 17:05:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:51,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:51,688 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:51,689 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:05:51,689 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:05:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:05:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:05:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-16 17:05:51,695 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-16 17:05:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:51,696 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-16 17:05:51,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-16 17:05:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:05:51,697 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:51,697 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] [2019-09-16 17:05:51,697 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:51,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1277180062, now seen corresponding path program 1 times [2019-09-16 17:05:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:51,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:51,752 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:51,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:51,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:51,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:51,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:51,754 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-16 17:05:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,060 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-16 17:05:52,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:05:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,062 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:52,062 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:52,063 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:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-16 17:05:52,070 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-16 17:05:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,070 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-16 17:05:52,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-16 17:05:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-16 17:05:52,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,072 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] [2019-09-16 17:05:52,072 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1706280906, now seen corresponding path program 1 times [2019-09-16 17:05:52,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,132 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:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,134 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-16 17:05:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,396 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:05:52,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-16 17:05:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,399 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:52,399 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:52,399 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,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-16 17:05:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-16 17:05:52,405 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-16 17:05:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,405 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-16 17:05:52,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-16 17:05:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-16 17:05:52,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,407 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] [2019-09-16 17:05:52,407 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1052652213, now seen corresponding path program 1 times [2019-09-16 17:05:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,460 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:52,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,461 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-16 17:05:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:52,771 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:05:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:52,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-16 17:05:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:52,774 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:05:52,774 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:05:52,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:05:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:05:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:05:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-16 17:05:52,784 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-16 17:05:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-16 17:05:52,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-16 17:05:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:52,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:52,786 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] [2019-09-16 17:05:52,787 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1001699063, now seen corresponding path program 1 times [2019-09-16 17:05:52,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:52,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:52,857 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:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:52,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:52,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:52,863 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-16 17:05:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,170 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-16 17:05:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,172 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:05:53,172 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:05:53,172 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,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:05:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-16 17:05:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-16 17:05:53,178 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-16 17:05:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,179 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-16 17:05:53,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-16 17:05:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:05:53,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,180 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] [2019-09-16 17:05:53,180 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 641832392, now seen corresponding path program 1 times [2019-09-16 17:05:53,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,237 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:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,239 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-16 17:05:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,541 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-16 17:05:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:05:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,543 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:53,543 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:53,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:05:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-16 17:05:53,549 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-16 17:05:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,550 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-16 17:05:53,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-16 17:05:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 17:05:53,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,551 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] [2019-09-16 17:05:53,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -976456270, now seen corresponding path program 1 times [2019-09-16 17:05:53,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,611 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:53,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,613 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-16 17:05:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:53,882 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-16 17:05:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:53,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-16 17:05:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:53,884 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:53,884 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:53,885 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:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-16 17:05:53,890 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-16 17:05:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:53,890 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-16 17:05:53,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-16 17:05:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-16 17:05:53,892 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:53,892 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] [2019-09-16 17:05:53,892 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1591624005, now seen corresponding path program 1 times [2019-09-16 17:05:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:53,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:53,961 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:53,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:53,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:53,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:53,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:53,963 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-16 17:05:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,320 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-16 17:05:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-16 17:05:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,323 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:54,323 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:54,323 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:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-16 17:05:54,332 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-16 17:05:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,332 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-16 17:05:54,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-16 17:05:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-16 17:05:54,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,334 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] [2019-09-16 17:05:54,334 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1684300691, now seen corresponding path program 1 times [2019-09-16 17:05:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,403 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:54,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,406 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-16 17:05:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:54,714 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-16 17:05:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:54,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-16 17:05:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:54,716 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:05:54,716 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:05:54,717 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,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:05:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:05:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-16 17:05:54,722 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-16 17:05:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:54,722 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-16 17:05:54,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-16 17:05:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 17:05:54,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:54,724 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] [2019-09-16 17:05:54,724 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785760, now seen corresponding path program 1 times [2019-09-16 17:05:54,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:54,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:54,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:54,786 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:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:54,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:54,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:54,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:54,788 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-16 17:05:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,064 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-16 17:05:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-16 17:05:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,065 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:05:55,066 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:05:55,066 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:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:05:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-16 17:05:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:05:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-16 17:05:55,070 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-16 17:05:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,070 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-16 17:05:55,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-16 17:05:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:55,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,071 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] [2019-09-16 17:05:55,071 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 164825720, now seen corresponding path program 1 times [2019-09-16 17:05:55,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,140 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:55,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,142 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-16 17:05:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:55,704 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-16 17:05:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:55,708 INFO L225 Difference]: With dead ends: 300 [2019-09-16 17:05:55,708 INFO L226 Difference]: Without dead ends: 300 [2019-09-16 17:05:55,708 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-16 17:05:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-16 17:05:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-16 17:05:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-16 17:05:55,719 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-16 17:05:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:55,719 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-16 17:05:55,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-16 17:05:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:55,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:55,722 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] [2019-09-16 17:05:55,722 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 92439162, now seen corresponding path program 1 times [2019-09-16 17:05:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:55,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:55,814 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:55,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:55,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:55,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:55,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:55,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:55,816 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-16 17:05:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,144 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-16 17:05:56,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,147 INFO L225 Difference]: With dead ends: 273 [2019-09-16 17:05:56,147 INFO L226 Difference]: Without dead ends: 273 [2019-09-16 17:05:56,147 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:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-16 17:05:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-16 17:05:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 17:05:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-16 17:05:56,154 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-16 17:05:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,154 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-16 17:05:56,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-16 17:05:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:56,155 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,155 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] [2019-09-16 17:05:56,156 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1395813593, now seen corresponding path program 1 times [2019-09-16 17:05:56,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,228 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:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,230 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-16 17:05:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:56,798 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-16 17:05:56,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:56,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:56,802 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:05:56,803 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:05:56,803 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:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:05:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-16 17:05:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-16 17:05:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-16 17:05:56,816 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-16 17:05:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:56,817 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-16 17:05:56,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-16 17:05:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:05:56,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:56,820 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:56,820 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1216785671, now seen corresponding path program 1 times [2019-09-16 17:05:56,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:56,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:56,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:56,959 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:56,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:56,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:56,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:56,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:56,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:56,962 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-16 17:05:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,358 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-16 17:05:57,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:05:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,362 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:05:57,362 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:05:57,362 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,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:05:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-16 17:05:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-16 17:05:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-16 17:05:57,370 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 87 [2019-09-16 17:05:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,371 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-16 17:05:57,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-16 17:05:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:05:57,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,372 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:57,373 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1151532565, now seen corresponding path program 1 times [2019-09-16 17:05:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,449 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:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,451 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:57,857 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-16 17:05:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:57,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:05:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:57,859 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:05:57,859 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:05:57,860 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,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:05:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-16 17:05:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-16 17:05:57,867 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 88 [2019-09-16 17:05:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:57,868 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-16 17:05:57,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-16 17:05:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:57,870 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:57,870 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] [2019-09-16 17:05:57,870 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash -528538785, now seen corresponding path program 1 times [2019-09-16 17:05:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:57,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:57,950 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:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:57,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:57,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:57,956 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-16 17:05:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,405 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2019-09-16 17:05:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,407 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:05:58,407 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:05:58,408 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:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:05:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-09-16 17:05:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-16 17:05:58,415 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-16 17:05:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,416 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-16 17:05:58,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-16 17:05:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:05:58,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,417 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] [2019-09-16 17:05:58,417 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1399733917, now seen corresponding path program 1 times [2019-09-16 17:05:58,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,507 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:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,509 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-16 17:05:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:58,839 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-16 17:05:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:58,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:05:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:58,843 INFO L225 Difference]: With dead ends: 285 [2019-09-16 17:05:58,843 INFO L226 Difference]: Without dead ends: 285 [2019-09-16 17:05:58,844 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:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-16 17:05:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-16 17:05:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-16 17:05:58,851 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-16 17:05:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:58,851 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-16 17:05:58,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-16 17:05:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:58,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,853 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] [2019-09-16 17:05:58,853 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1520987551, now seen corresponding path program 1 times [2019-09-16 17:05:58,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:58,921 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:58,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:58,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:58,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:58,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:58,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:58,923 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-16 17:05:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,329 INFO L93 Difference]: Finished difference Result 307 states and 452 transitions. [2019-09-16 17:05:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,331 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:59,331 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:59,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:05:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-16 17:05:59,339 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-16 17:05:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,340 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-16 17:05:59,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-16 17:05:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:59,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,341 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] [2019-09-16 17:05:59,341 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1130448290, now seen corresponding path program 1 times [2019-09-16 17:05:59,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,412 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:59,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,414 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-16 17:05:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,796 INFO L93 Difference]: Finished difference Result 305 states and 449 transitions. [2019-09-16 17:05:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:05:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,800 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:59,800 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:59,801 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:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:05:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:05:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-16 17:05:59,808 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-16 17:05:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,808 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-16 17:05:59,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-16 17:05:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:05:59,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,810 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] [2019-09-16 17:05:59,810 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1167899169, now seen corresponding path program 1 times [2019-09-16 17:05:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,878 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:59,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,879 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-16 17:06:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,191 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-16 17:06:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,195 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:00,195 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:00,196 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:06:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-16 17:06:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-16 17:06:00,202 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-16 17:06:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,202 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-16 17:06:00,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-16 17:06:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:06:00,204 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,204 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] [2019-09-16 17:06:00,204 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1483536672, now seen corresponding path program 1 times [2019-09-16 17:06:00,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,273 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:06:00,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,275 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-16 17:06:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,559 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-16 17:06:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,568 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:00,568 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:00,569 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:06:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-16 17:06:00,578 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-16 17:06:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,579 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-16 17:06:00,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-16 17:06:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:06:00,580 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,580 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] [2019-09-16 17:06:00,581 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash -82582564, now seen corresponding path program 1 times [2019-09-16 17:06:00,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,657 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:06:00,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,659 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-16 17:06:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,064 INFO L93 Difference]: Finished difference Result 305 states and 446 transitions. [2019-09-16 17:06:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:06:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,067 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:06:01,067 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:06:01,067 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:06:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:06:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:06:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-16 17:06:01,074 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-16 17:06:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,074 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-16 17:06:01,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-16 17:06:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:06:01,075 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,076 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] [2019-09-16 17:06:01,076 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579482, now seen corresponding path program 1 times [2019-09-16 17:06:01,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,137 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:06:01,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,139 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-16 17:06:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,420 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-16 17:06:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:06:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,424 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:01,424 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:01,425 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:06:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-16 17:06:01,431 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-16 17:06:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,431 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-16 17:06:01,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-16 17:06:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:06:01,433 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,433 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] [2019-09-16 17:06:01,433 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash -763062181, now seen corresponding path program 1 times [2019-09-16 17:06:01,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,499 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:06:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,501 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-16 17:06:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,873 INFO L93 Difference]: Finished difference Result 305 states and 444 transitions. [2019-09-16 17:06:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:01,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:06:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,876 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:06:01,876 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:06:01,877 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:06:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:06:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:06:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-16 17:06:01,883 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-16 17:06:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,883 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-16 17:06:01,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-16 17:06:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:06:01,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,885 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] [2019-09-16 17:06:01,885 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -778580899, now seen corresponding path program 1 times [2019-09-16 17:06:01,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,951 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:06:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,954 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-16 17:06:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,273 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-16 17:06:02,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:06:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,276 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:02,276 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:02,277 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:06:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-16 17:06:02,283 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-16 17:06:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,283 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-16 17:06:02,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-16 17:06:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:06:02,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,284 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] [2019-09-16 17:06:02,285 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1665128425, now seen corresponding path program 1 times [2019-09-16 17:06:02,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,346 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:06:02,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,348 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-16 17:06:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,707 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-09-16 17:06:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:06:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,710 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:06:02,710 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:06:02,710 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:06:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:06:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2019-09-16 17:06:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-16 17:06:02,716 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-16 17:06:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,717 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-16 17:06:02,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-16 17:06:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:06:02,718 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,718 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] [2019-09-16 17:06:02,718 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2146208683, now seen corresponding path program 1 times [2019-09-16 17:06:02,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,777 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:06:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,779 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-16 17:06:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,154 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-16 17:06:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:06:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,156 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:03,157 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:03,157 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:06:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-16 17:06:03,163 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-16 17:06:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,163 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-16 17:06:03,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-16 17:06:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:06:03,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,164 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] [2019-09-16 17:06:03,165 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash -846445514, now seen corresponding path program 1 times [2019-09-16 17:06:03,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,231 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:06:03,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,235 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-16 17:06:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,566 INFO L93 Difference]: Finished difference Result 295 states and 428 transitions. [2019-09-16 17:06:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:06:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,569 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:06:03,569 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:06:03,569 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:06:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:06:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-16 17:06:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-16 17:06:03,575 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-16 17:06:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,575 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-16 17:06:03,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-16 17:06:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:06:03,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,576 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] [2019-09-16 17:06:03,577 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1419935672, now seen corresponding path program 1 times [2019-09-16 17:06:03,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,648 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:06:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,650 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-16 17:06:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,913 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-16 17:06:03,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:06:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,916 INFO L225 Difference]: With dead ends: 272 [2019-09-16 17:06:03,916 INFO L226 Difference]: Without dead ends: 272 [2019-09-16 17:06:03,916 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:06:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-16 17:06:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-16 17:06:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-16 17:06:03,925 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-16 17:06:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,927 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-16 17:06:03,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-16 17:06:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:03,929 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,929 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] [2019-09-16 17:06:03,929 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash 228784092, now seen corresponding path program 1 times [2019-09-16 17:06:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,013 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:06:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,014 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-16 17:06:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,341 INFO L93 Difference]: Finished difference Result 295 states and 426 transitions. [2019-09-16 17:06:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,343 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:06:04,343 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:06:04,343 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:06:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:06:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2019-09-16 17:06:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-16 17:06:04,349 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-16 17:06:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,350 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-16 17:06:04,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-16 17:06:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:04,351 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,351 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,351 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1615569502, now seen corresponding path program 1 times [2019-09-16 17:06:04,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 17:06:04,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:04,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:04,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:04,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:04,420 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-16 17:06:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,467 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-16 17:06:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:04,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-16 17:06:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,470 INFO L225 Difference]: With dead ends: 493 [2019-09-16 17:06:04,470 INFO L226 Difference]: Without dead ends: 493 [2019-09-16 17:06:04,470 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:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-16 17:06:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-16 17:06:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-16 17:06:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-16 17:06:04,480 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-16 17:06:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,481 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-16 17:06:04,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-16 17:06:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:04,482 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,482 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] [2019-09-16 17:06:04,483 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash -929123768, now seen corresponding path program 1 times [2019-09-16 17:06:04,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,554 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:06:04,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:04,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:04,556 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-16 17:06:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,623 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-16 17:06:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:04,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:06:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,628 INFO L225 Difference]: With dead ends: 728 [2019-09-16 17:06:04,629 INFO L226 Difference]: Without dead ends: 728 [2019-09-16 17:06:04,629 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:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-16 17:06:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-16 17:06:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-16 17:06:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-16 17:06:04,642 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-16 17:06:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,643 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-16 17:06:04,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-16 17:06:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-16 17:06:04,645 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,645 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,646 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1433035977, now seen corresponding path program 1 times [2019-09-16 17:06:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,737 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:06:04,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:04,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:04,739 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-16 17:06:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,793 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-16 17:06:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:04,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-16 17:06:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,798 INFO L225 Difference]: With dead ends: 961 [2019-09-16 17:06:04,798 INFO L226 Difference]: Without dead ends: 961 [2019-09-16 17:06:04,799 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:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-16 17:06:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-16 17:06:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-16 17:06:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-16 17:06:04,822 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 111 [2019-09-16 17:06:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,822 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-16 17:06:04,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-16 17:06:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:06:04,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,826 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:06:04,826 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1705492387, now seen corresponding path program 1 times [2019-09-16 17:06:04,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,946 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:06:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,948 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-16 17:06:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,463 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-16 17:06:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:06:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,470 INFO L225 Difference]: With dead ends: 1369 [2019-09-16 17:06:05,471 INFO L226 Difference]: Without dead ends: 1369 [2019-09-16 17:06:05,471 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,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-16 17:06:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-16 17:06:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-16 17:06:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-16 17:06:05,495 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 128 [2019-09-16 17:06:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,496 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-16 17:06:05,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-16 17:06:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:06:05,499 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,499 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:06:05,499 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1113473743, now seen corresponding path program 1 times [2019-09-16 17:06:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,598 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:06:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,600 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-16 17:06:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,073 INFO L93 Difference]: Finished difference Result 1343 states and 1984 transitions. [2019-09-16 17:06:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-16 17:06:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,081 INFO L225 Difference]: With dead ends: 1343 [2019-09-16 17:06:06,081 INFO L226 Difference]: Without dead ends: 1343 [2019-09-16 17:06:06,082 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,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-09-16 17:06:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2019-09-16 17:06:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-16 17:06:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-16 17:06:06,107 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 129 [2019-09-16 17:06:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,108 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-16 17:06:06,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-16 17:06:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:06:06,111 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,111 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] [2019-09-16 17:06:06,111 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash -502838968, now seen corresponding path program 1 times [2019-09-16 17:06:06,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,186 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:06:06,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:06,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:06,187 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-16 17:06:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,230 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-16 17:06:06,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:06,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-16 17:06:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,236 INFO L225 Difference]: With dead ends: 1339 [2019-09-16 17:06:06,237 INFO L226 Difference]: Without dead ends: 1339 [2019-09-16 17:06:06,237 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:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-16 17:06:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-16 17:06:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-16 17:06:06,259 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-16 17:06:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,260 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-16 17:06:06,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-16 17:06:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:06,263 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,263 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-09-16 17:06:06,264 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -325968604, now seen corresponding path program 1 times [2019-09-16 17:06:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:06,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:06,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,332 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-16 17:06:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,881 INFO L93 Difference]: Finished difference Result 1672 states and 2464 transitions. [2019-09-16 17:06:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,889 INFO L225 Difference]: With dead ends: 1672 [2019-09-16 17:06:06,890 INFO L226 Difference]: Without dead ends: 1672 [2019-09-16 17:06:06,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:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-09-16 17:06:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2019-09-16 17:06:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-16 17:06:06,919 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 141 [2019-09-16 17:06:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,919 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-16 17:06:06,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-16 17:06:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:06,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,923 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-16 17:06:06,923 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1950880156, now seen corresponding path program 1 times [2019-09-16 17:06:06,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,032 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-16 17:06:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:07,487 INFO L93 Difference]: Finished difference Result 1667 states and 2454 transitions. [2019-09-16 17:06:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:07,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:07,495 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:06:07,495 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:06:07,495 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,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:06:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:06:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-16 17:06:07,518 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 142 [2019-09-16 17:06:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:07,519 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-16 17:06:07,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-16 17:06:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:07,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,522 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-16 17:06:07,522 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1810153469, now seen corresponding path program 1 times [2019-09-16 17:06:07,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,599 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-16 17:06:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,016 INFO L93 Difference]: Finished difference Result 1657 states and 2439 transitions. [2019-09-16 17:06:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,023 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:06:08,023 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:06:08,023 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,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:06:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:06:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-16 17:06:08,045 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 142 [2019-09-16 17:06:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,045 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-16 17:06:08,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-16 17:06:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:06:08,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,049 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:08,049 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1971395847, now seen corresponding path program 1 times [2019-09-16 17:06:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,121 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:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,122 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-16 17:06:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,544 INFO L93 Difference]: Finished difference Result 1657 states and 2434 transitions. [2019-09-16 17:06:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:06:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,557 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:06:08,558 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:06:08,559 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,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:06:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:06:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-16 17:06:08,579 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 143 [2019-09-16 17:06:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,580 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-16 17:06:08,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-16 17:06:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:06:08,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,583 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:08,583 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2102895712, now seen corresponding path program 1 times [2019-09-16 17:06:08,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,650 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:08,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,652 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-16 17:06:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,070 INFO L93 Difference]: Finished difference Result 1657 states and 2429 transitions. [2019-09-16 17:06:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:06:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,078 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:06:09,078 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:06:09,078 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,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:06:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:06:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-16 17:06:09,099 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 144 [2019-09-16 17:06:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,100 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-16 17:06:09,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-16 17:06:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:06:09,103 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,103 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:09,103 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1145780372, now seen corresponding path program 1 times [2019-09-16 17:06:09,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,183 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:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,189 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:06:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,643 INFO L93 Difference]: Finished difference Result 1657 states and 2424 transitions. [2019-09-16 17:06:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:06:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,651 INFO L225 Difference]: With dead ends: 1657 [2019-09-16 17:06:09,652 INFO L226 Difference]: Without dead ends: 1657 [2019-09-16 17:06:09,652 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,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-16 17:06:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2019-09-16 17:06:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-16 17:06:09,672 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 145 [2019-09-16 17:06:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,673 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-16 17:06:09,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-16 17:06:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 17:06:09,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,676 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:09,677 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1805728475, now seen corresponding path program 1 times [2019-09-16 17:06:09,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,750 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:09,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,751 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:06:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,136 INFO L93 Difference]: Finished difference Result 1607 states and 2359 transitions. [2019-09-16 17:06:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 17:06:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,141 INFO L225 Difference]: With dead ends: 1607 [2019-09-16 17:06:10,141 INFO L226 Difference]: Without dead ends: 1607 [2019-09-16 17:06:10,142 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,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-16 17:06:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2019-09-16 17:06:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-16 17:06:10,161 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 146 [2019-09-16 17:06:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,162 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-16 17:06:10,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-16 17:06:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:06:10,165 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,165 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:10,165 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash 163093695, now seen corresponding path program 1 times [2019-09-16 17:06:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:10,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,243 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:06:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,635 INFO L93 Difference]: Finished difference Result 1607 states and 2354 transitions. [2019-09-16 17:06:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:06:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,653 INFO L225 Difference]: With dead ends: 1607 [2019-09-16 17:06:10,653 INFO L226 Difference]: Without dead ends: 1607 [2019-09-16 17:06:10,653 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,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-16 17:06:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2019-09-16 17:06:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-16 17:06:10,675 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 150 [2019-09-16 17:06:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,675 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-16 17:06:10,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-16 17:06:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-16 17:06:10,678 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,678 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:10,679 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1361192058, now seen corresponding path program 1 times [2019-09-16 17:06:10,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:10,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,755 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:06:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,147 INFO L93 Difference]: Finished difference Result 1582 states and 2317 transitions. [2019-09-16 17:06:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-16 17:06:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,153 INFO L225 Difference]: With dead ends: 1582 [2019-09-16 17:06:11,153 INFO L226 Difference]: Without dead ends: 1582 [2019-09-16 17:06:11,154 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,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-16 17:06:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2019-09-16 17:06:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-16 17:06:11,172 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 151 [2019-09-16 17:06:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,173 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-16 17:06:11,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-16 17:06:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:11,176 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,176 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:11,176 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1910207142, now seen corresponding path program 1 times [2019-09-16 17:06:11,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,257 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:11,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,259 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,646 INFO L93 Difference]: Finished difference Result 1582 states and 2312 transitions. [2019-09-16 17:06:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,651 INFO L225 Difference]: With dead ends: 1582 [2019-09-16 17:06:11,651 INFO L226 Difference]: Without dead ends: 1582 [2019-09-16 17:06:11,652 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,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-16 17:06:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2019-09-16 17:06:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-16 17:06:11,692 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 153 [2019-09-16 17:06:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,693 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-16 17:06:11,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-16 17:06:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:11,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,696 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:11,696 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -937425985, now seen corresponding path program 1 times [2019-09-16 17:06:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,767 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:11,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,769 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,126 INFO L93 Difference]: Finished difference Result 1542 states and 2242 transitions. [2019-09-16 17:06:12,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,132 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:06:12,132 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:06:12,132 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,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:06:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1317. [2019-09-16 17:06:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-16 17:06:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-16 17:06:12,149 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 154 [2019-09-16 17:06:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,149 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-16 17:06:12,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-16 17:06:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:12,153 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,153 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, 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:12,153 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash 985369895, now seen corresponding path program 1 times [2019-09-16 17:06:12,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,245 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-16 17:06:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,619 INFO L93 Difference]: Finished difference Result 1542 states and 2237 transitions. [2019-09-16 17:06:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,623 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:06:12,623 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:06:12,623 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,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:06:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2019-09-16 17:06:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-16 17:06:12,640 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 155 [2019-09-16 17:06:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,640 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-16 17:06:12,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-16 17:06:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:12,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,643 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, 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:12,643 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -850098038, now seen corresponding path program 1 times [2019-09-16 17:06:12,644 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,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:12,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,728 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,085 INFO L93 Difference]: Finished difference Result 1542 states and 2232 transitions. [2019-09-16 17:06:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,090 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:06:13,090 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:06:13,090 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,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:06:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2019-09-16 17:06:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-16 17:06:13,107 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 156 [2019-09-16 17:06:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,108 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-16 17:06:13,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-16 17:06:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:13,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,111 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, 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:13,111 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash -163898208, now seen corresponding path program 1 times [2019-09-16 17:06:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:13,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,192 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,531 INFO L93 Difference]: Finished difference Result 1532 states and 2217 transitions. [2019-09-16 17:06:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,536 INFO L225 Difference]: With dead ends: 1532 [2019-09-16 17:06:13,536 INFO L226 Difference]: Without dead ends: 1532 [2019-09-16 17:06:13,537 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,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-16 17:06:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-16 17:06:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-16 17:06:13,553 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 156 [2019-09-16 17:06:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,554 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-16 17:06:13,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-16 17:06:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:13,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,556 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, 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:13,557 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash 247716209, now seen corresponding path program 1 times [2019-09-16 17:06:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,645 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,082 INFO L93 Difference]: Finished difference Result 1522 states and 2197 transitions. [2019-09-16 17:06:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,086 INFO L225 Difference]: With dead ends: 1522 [2019-09-16 17:06:14,086 INFO L226 Difference]: Without dead ends: 1522 [2019-09-16 17:06:14,087 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,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2019-09-16 17:06:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1347. [2019-09-16 17:06:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-16 17:06:14,105 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 157 [2019-09-16 17:06:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,106 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-16 17:06:14,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-16 17:06:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:14,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,109 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:14,109 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 280620937, now seen corresponding path program 1 times [2019-09-16 17:06:14,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,184 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:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,186 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,511 INFO L93 Difference]: Finished difference Result 1507 states and 2172 transitions. [2019-09-16 17:06:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,518 INFO L225 Difference]: With dead ends: 1507 [2019-09-16 17:06:14,518 INFO L226 Difference]: Without dead ends: 1507 [2019-09-16 17:06:14,518 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,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2019-09-16 17:06:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1352. [2019-09-16 17:06:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 17:06:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-16 17:06:14,535 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 157 [2019-09-16 17:06:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,536 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-16 17:06:14,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-16 17:06:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:14,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,539 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:14,539 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1984415224, now seen corresponding path program 1 times [2019-09-16 17:06:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,633 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:14,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,636 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,960 INFO L93 Difference]: Finished difference Result 1507 states and 2167 transitions. [2019-09-16 17:06:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,966 INFO L225 Difference]: With dead ends: 1507 [2019-09-16 17:06:14,966 INFO L226 Difference]: Without dead ends: 1507 [2019-09-16 17:06:14,967 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,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2019-09-16 17:06:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1357. [2019-09-16 17:06:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-16 17:06:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-16 17:06:14,982 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 159 [2019-09-16 17:06:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,982 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-16 17:06:14,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-16 17:06:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:14,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,987 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:14,988 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1376767188, now seen corresponding path program 1 times [2019-09-16 17:06:14,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,094 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:15,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,095 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,414 INFO L93 Difference]: Finished difference Result 1487 states and 2137 transitions. [2019-09-16 17:06:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,418 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:15,418 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:15,419 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,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1362. [2019-09-16 17:06:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-16 17:06:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-16 17:06:15,436 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 160 [2019-09-16 17:06:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,437 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-16 17:06:15,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-16 17:06:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:15,439 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,440 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:15,440 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1562534294, now seen corresponding path program 1 times [2019-09-16 17:06:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,520 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:15,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,524 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:06:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,838 INFO L93 Difference]: Finished difference Result 1487 states and 2132 transitions. [2019-09-16 17:06:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,842 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:15,842 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:15,842 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,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1367. [2019-09-16 17:06:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:06:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-16 17:06:15,859 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 160 [2019-09-16 17:06:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,860 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-16 17:06:15,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-16 17:06:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:06:15,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,866 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:15,866 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1146992726, now seen corresponding path program 1 times [2019-09-16 17:06:15,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,955 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:15,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,959 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:06:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,273 INFO L93 Difference]: Finished difference Result 1477 states and 2117 transitions. [2019-09-16 17:06:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:06:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,276 INFO L225 Difference]: With dead ends: 1477 [2019-09-16 17:06:16,276 INFO L226 Difference]: Without dead ends: 1477 [2019-09-16 17:06:16,277 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,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-16 17:06:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1372. [2019-09-16 17:06:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-16 17:06:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-16 17:06:16,293 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 161 [2019-09-16 17:06:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,294 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-16 17:06:16,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-16 17:06:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:16,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,297 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:16,298 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1926892495, now seen corresponding path program 1 times [2019-09-16 17:06:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,400 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:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,403 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:06:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,730 INFO L93 Difference]: Finished difference Result 1477 states and 2112 transitions. [2019-09-16 17:06:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,734 INFO L225 Difference]: With dead ends: 1477 [2019-09-16 17:06:16,734 INFO L226 Difference]: Without dead ends: 1477 [2019-09-16 17:06:16,734 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,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-09-16 17:06:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1377. [2019-09-16 17:06:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-16 17:06:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-16 17:06:16,757 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2019-09-16 17:06:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,757 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-16 17:06:16,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-16 17:06:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:16,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,761 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:16,761 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1730790565, now seen corresponding path program 1 times [2019-09-16 17:06:16,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,862 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:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,863 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:06:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,146 INFO L93 Difference]: Finished difference Result 1467 states and 2097 transitions. [2019-09-16 17:06:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,149 INFO L225 Difference]: With dead ends: 1467 [2019-09-16 17:06:17,149 INFO L226 Difference]: Without dead ends: 1467 [2019-09-16 17:06:17,149 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,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-16 17:06:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2019-09-16 17:06:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-16 17:06:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-16 17:06:17,160 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2019-09-16 17:06:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,161 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-16 17:06:17,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-16 17:06:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-16 17:06:17,162 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,162 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:17,163 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1612762117, now seen corresponding path program 1 times [2019-09-16 17:06:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,243 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:17,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:17,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,245 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 3 states. [2019-09-16 17:06:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,289 INFO L93 Difference]: Finished difference Result 1647 states and 2368 transitions. [2019-09-16 17:06:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:17,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-16 17:06:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,291 INFO L225 Difference]: With dead ends: 1647 [2019-09-16 17:06:17,291 INFO L226 Difference]: Without dead ends: 1647 [2019-09-16 17:06:17,292 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:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-16 17:06:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2019-09-16 17:06:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-09-16 17:06:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2368 transitions. [2019-09-16 17:06:17,310 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2368 transitions. Word has length 171 [2019-09-16 17:06:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,311 INFO L475 AbstractCegarLoop]: Abstraction has 1647 states and 2368 transitions. [2019-09-16 17:06:17,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2368 transitions. [2019-09-16 17:06:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-16 17:06:17,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,314 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:17,314 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1364615623, now seen corresponding path program 1 times [2019-09-16 17:06:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,379 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:17,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:17,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:17,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,380 INFO L87 Difference]: Start difference. First operand 1647 states and 2368 transitions. Second operand 3 states. [2019-09-16 17:06:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,426 INFO L93 Difference]: Finished difference Result 1915 states and 2752 transitions. [2019-09-16 17:06:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:17,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-16 17:06:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,428 INFO L225 Difference]: With dead ends: 1915 [2019-09-16 17:06:17,428 INFO L226 Difference]: Without dead ends: 1915 [2019-09-16 17:06:17,429 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:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2019-09-16 17:06:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1915. [2019-09-16 17:06:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-09-16 17:06:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2752 transitions. [2019-09-16 17:06:17,449 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2752 transitions. Word has length 171 [2019-09-16 17:06:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,450 INFO L475 AbstractCegarLoop]: Abstraction has 1915 states and 2752 transitions. [2019-09-16 17:06:17,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2752 transitions. [2019-09-16 17:06:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:06:17,453 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,454 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,455 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1816279740, now seen corresponding path program 1 times [2019-09-16 17:06:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:17,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,543 INFO L87 Difference]: Start difference. First operand 1915 states and 2752 transitions. Second operand 4 states. [2019-09-16 17:06:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,905 INFO L93 Difference]: Finished difference Result 2356 states and 3416 transitions. [2019-09-16 17:06:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-16 17:06:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,908 INFO L225 Difference]: With dead ends: 2356 [2019-09-16 17:06:17,908 INFO L226 Difference]: Without dead ends: 2356 [2019-09-16 17:06:17,909 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,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-09-16 17:06:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2111. [2019-09-16 17:06:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3095 transitions. [2019-09-16 17:06:17,936 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3095 transitions. Word has length 174 [2019-09-16 17:06:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,936 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3095 transitions. [2019-09-16 17:06:17,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3095 transitions. [2019-09-16 17:06:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-16 17:06:17,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,941 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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:17,942 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -480351915, now seen corresponding path program 1 times [2019-09-16 17:06:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:18,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,076 INFO L87 Difference]: Start difference. First operand 2111 states and 3095 transitions. Second operand 4 states. [2019-09-16 17:06:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,422 INFO L93 Difference]: Finished difference Result 2356 states and 3409 transitions. [2019-09-16 17:06:18,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-09-16 17:06:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,424 INFO L225 Difference]: With dead ends: 2356 [2019-09-16 17:06:18,424 INFO L226 Difference]: Without dead ends: 2356 [2019-09-16 17:06:18,425 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,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-09-16 17:06:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2111. [2019-09-16 17:06:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3088 transitions. [2019-09-16 17:06:18,446 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3088 transitions. Word has length 187 [2019-09-16 17:06:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,446 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3088 transitions. [2019-09-16 17:06:18,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3088 transitions. [2019-09-16 17:06:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-16 17:06:18,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,450 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1025506165, now seen corresponding path program 1 times [2019-09-16 17:06:18,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:18,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,528 INFO L87 Difference]: Start difference. First operand 2111 states and 3088 transitions. Second operand 4 states. [2019-09-16 17:06:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,852 INFO L93 Difference]: Finished difference Result 2349 states and 3395 transitions. [2019-09-16 17:06:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-16 17:06:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,855 INFO L225 Difference]: With dead ends: 2349 [2019-09-16 17:06:18,855 INFO L226 Difference]: Without dead ends: 2349 [2019-09-16 17:06:18,855 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,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2019-09-16 17:06:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2111. [2019-09-16 17:06:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3081 transitions. [2019-09-16 17:06:18,871 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3081 transitions. Word has length 188 [2019-09-16 17:06:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,871 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3081 transitions. [2019-09-16 17:06:18,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3081 transitions. [2019-09-16 17:06:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-16 17:06:18,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,873 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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:18,874 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1741565546, now seen corresponding path program 1 times [2019-09-16 17:06:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:18,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,948 INFO L87 Difference]: Start difference. First operand 2111 states and 3081 transitions. Second operand 4 states. [2019-09-16 17:06:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,276 INFO L93 Difference]: Finished difference Result 2335 states and 3374 transitions. [2019-09-16 17:06:19,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-16 17:06:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,278 INFO L225 Difference]: With dead ends: 2335 [2019-09-16 17:06:19,278 INFO L226 Difference]: Without dead ends: 2335 [2019-09-16 17:06:19,279 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,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-09-16 17:06:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2111. [2019-09-16 17:06:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3074 transitions. [2019-09-16 17:06:19,294 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3074 transitions. Word has length 188 [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 2111 states and 3074 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 2111 states and 3074 transitions. [2019-09-16 17:06:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-16 17:06:19,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,297 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,297 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 668411256, now seen corresponding path program 1 times [2019-09-16 17:06:19,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,299 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,376 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:19,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,378 INFO L87 Difference]: Start difference. First operand 2111 states and 3074 transitions. Second operand 4 states. [2019-09-16 17:06:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,904 INFO L93 Difference]: Finished difference Result 2335 states and 3367 transitions. [2019-09-16 17:06:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-16 17:06:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,907 INFO L225 Difference]: With dead ends: 2335 [2019-09-16 17:06:19,908 INFO L226 Difference]: Without dead ends: 2335 [2019-09-16 17:06:19,908 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:06:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-09-16 17:06:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2111. [2019-09-16 17:06:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3067 transitions. [2019-09-16 17:06:19,931 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3067 transitions. Word has length 189 [2019-09-16 17:06:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,931 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3067 transitions. [2019-09-16 17:06:19,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3067 transitions. [2019-09-16 17:06:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-16 17:06:19,935 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,935 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, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,935 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -86702023, now seen corresponding path program 1 times [2019-09-16 17:06:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:20,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,019 INFO L87 Difference]: Start difference. First operand 2111 states and 3067 transitions. Second operand 4 states. [2019-09-16 17:06:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,482 INFO L93 Difference]: Finished difference Result 2335 states and 3360 transitions. [2019-09-16 17:06:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-16 17:06:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,485 INFO L225 Difference]: With dead ends: 2335 [2019-09-16 17:06:20,485 INFO L226 Difference]: Without dead ends: 2335 [2019-09-16 17:06:20,485 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:06:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-09-16 17:06:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2111. [2019-09-16 17:06:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3060 transitions. [2019-09-16 17:06:20,503 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3060 transitions. Word has length 190 [2019-09-16 17:06:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,503 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3060 transitions. [2019-09-16 17:06:20,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3060 transitions. [2019-09-16 17:06:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-16 17:06:20,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,506 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -370005091, now seen corresponding path program 1 times [2019-09-16 17:06:20,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:20,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,591 INFO L87 Difference]: Start difference. First operand 2111 states and 3060 transitions. Second operand 4 states. [2019-09-16 17:06:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,045 INFO L93 Difference]: Finished difference Result 2335 states and 3353 transitions. [2019-09-16 17:06:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-09-16 17:06:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,048 INFO L225 Difference]: With dead ends: 2335 [2019-09-16 17:06:21,048 INFO L226 Difference]: Without dead ends: 2335 [2019-09-16 17:06:21,048 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:06:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-09-16 17:06:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2111. [2019-09-16 17:06:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3053 transitions. [2019-09-16 17:06:21,064 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3053 transitions. Word has length 191 [2019-09-16 17:06:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,064 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3053 transitions. [2019-09-16 17:06:21,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3053 transitions. [2019-09-16 17:06:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-16 17:06:21,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,067 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1087906494, now seen corresponding path program 1 times [2019-09-16 17:06:21,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:21,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,158 INFO L87 Difference]: Start difference. First operand 2111 states and 3053 transitions. Second operand 4 states. [2019-09-16 17:06:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,460 INFO L93 Difference]: Finished difference Result 2265 states and 3262 transitions. [2019-09-16 17:06:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-16 17:06:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,465 INFO L225 Difference]: With dead ends: 2265 [2019-09-16 17:06:21,465 INFO L226 Difference]: Without dead ends: 2265 [2019-09-16 17:06:21,465 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:06:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2019-09-16 17:06:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2111. [2019-09-16 17:06:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3046 transitions. [2019-09-16 17:06:21,484 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3046 transitions. Word has length 192 [2019-09-16 17:06:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,485 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3046 transitions. [2019-09-16 17:06:21,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3046 transitions. [2019-09-16 17:06:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-16 17:06:21,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,488 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,489 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash -88856104, now seen corresponding path program 1 times [2019-09-16 17:06:21,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,563 INFO L87 Difference]: Start difference. First operand 2111 states and 3046 transitions. Second operand 4 states. [2019-09-16 17:06:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,876 INFO L93 Difference]: Finished difference Result 2265 states and 3255 transitions. [2019-09-16 17:06:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-16 17:06:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,879 INFO L225 Difference]: With dead ends: 2265 [2019-09-16 17:06:21,879 INFO L226 Difference]: Without dead ends: 2265 [2019-09-16 17:06:21,879 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,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2019-09-16 17:06:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2111. [2019-09-16 17:06:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3039 transitions. [2019-09-16 17:06:21,898 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3039 transitions. Word has length 196 [2019-09-16 17:06:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,898 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3039 transitions. [2019-09-16 17:06:21,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3039 transitions. [2019-09-16 17:06:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-16 17:06:21,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,901 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,901 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1238575049, now seen corresponding path program 1 times [2019-09-16 17:06:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,986 INFO L87 Difference]: Start difference. First operand 2111 states and 3039 transitions. Second operand 4 states. [2019-09-16 17:06:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,346 INFO L93 Difference]: Finished difference Result 2230 states and 3204 transitions. [2019-09-16 17:06:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-09-16 17:06:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,350 INFO L225 Difference]: With dead ends: 2230 [2019-09-16 17:06:22,351 INFO L226 Difference]: Without dead ends: 2230 [2019-09-16 17:06:22,352 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,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-09-16 17:06:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2111. [2019-09-16 17:06:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-16 17:06:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3032 transitions. [2019-09-16 17:06:22,379 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3032 transitions. Word has length 197 [2019-09-16 17:06:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,379 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3032 transitions. [2019-09-16 17:06:22,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3032 transitions. [2019-09-16 17:06:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-16 17:06:22,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,383 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash -253371305, now seen corresponding path program 1 times [2019-09-16 17:06:22,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,525 INFO L87 Difference]: Start difference. First operand 2111 states and 3032 transitions. Second operand 4 states. [2019-09-16 17:06:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,878 INFO L93 Difference]: Finished difference Result 2580 states and 3738 transitions. [2019-09-16 17:06:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-16 17:06:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,882 INFO L225 Difference]: With dead ends: 2580 [2019-09-16 17:06:22,882 INFO L226 Difference]: Without dead ends: 2580 [2019-09-16 17:06:22,883 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,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2019-09-16 17:06:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2321. [2019-09-16 17:06:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-09-16 17:06:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3403 transitions. [2019-09-16 17:06:22,899 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3403 transitions. Word has length 199 [2019-09-16 17:06:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,899 INFO L475 AbstractCegarLoop]: Abstraction has 2321 states and 3403 transitions. [2019-09-16 17:06:22,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3403 transitions. [2019-09-16 17:06:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-16 17:06:22,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,902 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,902 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1774120006, now seen corresponding path program 1 times [2019-09-16 17:06:22,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,013 INFO L87 Difference]: Start difference. First operand 2321 states and 3403 transitions. Second operand 4 states. [2019-09-16 17:06:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,469 INFO L93 Difference]: Finished difference Result 3032 states and 4466 transitions. [2019-09-16 17:06:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-16 17:06:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,473 INFO L225 Difference]: With dead ends: 3032 [2019-09-16 17:06:23,473 INFO L226 Difference]: Without dead ends: 3032 [2019-09-16 17:06:23,473 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:06:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-09-16 17:06:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2517. [2019-09-16 17:06:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2517 states. [2019-09-16 17:06:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3746 transitions. [2019-09-16 17:06:23,492 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3746 transitions. Word has length 205 [2019-09-16 17:06:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,492 INFO L475 AbstractCegarLoop]: Abstraction has 2517 states and 3746 transitions. [2019-09-16 17:06:23,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3746 transitions. [2019-09-16 17:06:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-16 17:06:23,496 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,497 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,497 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1418038231, now seen corresponding path program 1 times [2019-09-16 17:06:23,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,607 INFO L87 Difference]: Start difference. First operand 2517 states and 3746 transitions. Second operand 4 states. [2019-09-16 17:06:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,020 INFO L93 Difference]: Finished difference Result 2976 states and 4368 transitions. [2019-09-16 17:06:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-09-16 17:06:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,024 INFO L225 Difference]: With dead ends: 2976 [2019-09-16 17:06:24,024 INFO L226 Difference]: Without dead ends: 2976 [2019-09-16 17:06:24,024 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:06:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-09-16 17:06:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2524. [2019-09-16 17:06:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-09-16 17:06:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3753 transitions. [2019-09-16 17:06:24,046 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3753 transitions. Word has length 206 [2019-09-16 17:06:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,046 INFO L475 AbstractCegarLoop]: Abstraction has 2524 states and 3753 transitions. [2019-09-16 17:06:24,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3753 transitions. [2019-09-16 17:06:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:06:24,049 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,049 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,049 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -251901884, now seen corresponding path program 1 times [2019-09-16 17:06:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-16 17:06:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,153 INFO L87 Difference]: Start difference. First operand 2524 states and 3753 transitions. Second operand 4 states. [2019-09-16 17:06:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,579 INFO L93 Difference]: Finished difference Result 2976 states and 4361 transitions. [2019-09-16 17:06:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-16 17:06:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,582 INFO L225 Difference]: With dead ends: 2976 [2019-09-16 17:06:24,582 INFO L226 Difference]: Without dead ends: 2976 [2019-09-16 17:06:24,582 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:06:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-09-16 17:06:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2594. [2019-09-16 17:06:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2019-09-16 17:06:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3886 transitions. [2019-09-16 17:06:24,601 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3886 transitions. Word has length 210 [2019-09-16 17:06:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,602 INFO L475 AbstractCegarLoop]: Abstraction has 2594 states and 3886 transitions. [2019-09-16 17:06:24,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3886 transitions. [2019-09-16 17:06:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-16 17:06:24,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,604 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:06:24,604 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash 563793486, now seen corresponding path program 1 times [2019-09-16 17:06:24,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-16 17:06:24,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,742 INFO L87 Difference]: Start difference. First operand 2594 states and 3886 transitions. Second operand 4 states. [2019-09-16 17:06:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,158 INFO L93 Difference]: Finished difference Result 2936 states and 4305 transitions. [2019-09-16 17:06:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-09-16 17:06:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,161 INFO L225 Difference]: With dead ends: 2936 [2019-09-16 17:06:25,161 INFO L226 Difference]: Without dead ends: 2936 [2019-09-16 17:06:25,162 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:06:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2019-09-16 17:06:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2489. [2019-09-16 17:06:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-09-16 17:06:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3697 transitions. [2019-09-16 17:06:25,187 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3697 transitions. Word has length 211 [2019-09-16 17:06:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 2489 states and 3697 transitions. [2019-09-16 17:06:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3697 transitions. [2019-09-16 17:06:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-16 17:06:25,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,191 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,191 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2115351901, now seen corresponding path program 1 times [2019-09-16 17:06:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-16 17:06:25,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,283 INFO L87 Difference]: Start difference. First operand 2489 states and 3697 transitions. Second operand 4 states. [2019-09-16 17:06:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,737 INFO L93 Difference]: Finished difference Result 3200 states and 4760 transitions. [2019-09-16 17:06:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-16 17:06:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,741 INFO L225 Difference]: With dead ends: 3200 [2019-09-16 17:06:25,741 INFO L226 Difference]: Without dead ends: 3200 [2019-09-16 17:06:25,742 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,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-09-16 17:06:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2685. [2019-09-16 17:06:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-09-16 17:06:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 4040 transitions. [2019-09-16 17:06:25,770 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 4040 transitions. Word has length 218 [2019-09-16 17:06:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,770 INFO L475 AbstractCegarLoop]: Abstraction has 2685 states and 4040 transitions. [2019-09-16 17:06:25,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 4040 transitions. [2019-09-16 17:06:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-16 17:06:25,772 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,772 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,773 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1732583060, now seen corresponding path program 1 times [2019-09-16 17:06:25,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-16 17:06:25,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,871 INFO L87 Difference]: Start difference. First operand 2685 states and 4040 transitions. Second operand 4 states. [2019-09-16 17:06:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,295 INFO L93 Difference]: Finished difference Result 3144 states and 4662 transitions. [2019-09-16 17:06:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-09-16 17:06:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,298 INFO L225 Difference]: With dead ends: 3144 [2019-09-16 17:06:26,298 INFO L226 Difference]: Without dead ends: 3144 [2019-09-16 17:06:26,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:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-09-16 17:06:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2692. [2019-09-16 17:06:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-09-16 17:06:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4047 transitions. [2019-09-16 17:06:26,319 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4047 transitions. Word has length 219 [2019-09-16 17:06:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,319 INFO L475 AbstractCegarLoop]: Abstraction has 2692 states and 4047 transitions. [2019-09-16 17:06:26,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4047 transitions. [2019-09-16 17:06:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-16 17:06:26,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,322 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,323 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1924272550, now seen corresponding path program 1 times [2019-09-16 17:06:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:26,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,436 INFO L87 Difference]: Start difference. First operand 2692 states and 4047 transitions. Second operand 4 states. [2019-09-16 17:06:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,956 INFO L93 Difference]: Finished difference Result 3139 states and 4648 transitions. [2019-09-16 17:06:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-09-16 17:06:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,959 INFO L225 Difference]: With dead ends: 3139 [2019-09-16 17:06:26,959 INFO L226 Difference]: Without dead ends: 3139 [2019-09-16 17:06:26,960 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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:06:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-09-16 17:06:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2692. [2019-09-16 17:06:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-09-16 17:06:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4040 transitions. [2019-09-16 17:06:26,988 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4040 transitions. Word has length 220 [2019-09-16 17:06:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,989 INFO L475 AbstractCegarLoop]: Abstraction has 2692 states and 4040 transitions. [2019-09-16 17:06:26,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4040 transitions. [2019-09-16 17:06:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-16 17:06:26,993 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,993 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,993 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2020876899, now seen corresponding path program 1 times [2019-09-16 17:06:26,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,152 INFO L87 Difference]: Start difference. First operand 2692 states and 4040 transitions. Second operand 4 states. [2019-09-16 17:06:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,551 INFO L93 Difference]: Finished difference Result 3139 states and 4641 transitions. [2019-09-16 17:06:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-09-16 17:06:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,554 INFO L225 Difference]: With dead ends: 3139 [2019-09-16 17:06:27,555 INFO L226 Difference]: Without dead ends: 3139 [2019-09-16 17:06:27,555 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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:06:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-09-16 17:06:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2692. [2019-09-16 17:06:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-09-16 17:06:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4033 transitions. [2019-09-16 17:06:27,575 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4033 transitions. Word has length 221 [2019-09-16 17:06:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,575 INFO L475 AbstractCegarLoop]: Abstraction has 2692 states and 4033 transitions. [2019-09-16 17:06:27,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4033 transitions. [2019-09-16 17:06:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-16 17:06:27,577 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,577 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,578 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2002679019, now seen corresponding path program 1 times [2019-09-16 17:06:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:27,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,667 INFO L87 Difference]: Start difference. First operand 2692 states and 4033 transitions. Second operand 4 states. [2019-09-16 17:06:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,059 INFO L93 Difference]: Finished difference Result 3139 states and 4634 transitions. [2019-09-16 17:06:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-09-16 17:06:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,062 INFO L225 Difference]: With dead ends: 3139 [2019-09-16 17:06:28,062 INFO L226 Difference]: Without dead ends: 3139 [2019-09-16 17:06:28,063 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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:06:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-09-16 17:06:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2692. [2019-09-16 17:06:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-09-16 17:06:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4026 transitions. [2019-09-16 17:06:28,082 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4026 transitions. Word has length 222 [2019-09-16 17:06:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,083 INFO L475 AbstractCegarLoop]: Abstraction has 2692 states and 4026 transitions. [2019-09-16 17:06:28,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4026 transitions. [2019-09-16 17:06:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-16 17:06:28,085 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,085 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,085 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1230397987, now seen corresponding path program 1 times [2019-09-16 17:06:28,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 151 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-16 17:06:28,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:28,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:28,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2019-09-16 17:06:28,201 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [106], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [303], [308], [312], [315], [323], [325], [328], [336], [339], [343], [523], [526], [528], [531], [544], [547], [551], [553], [558], [561], [569], [574], [576], [579], [587], [592], [594], [615], [649], [651], [663], [666], [667], [679], [687], [688], [689] [2019-09-16 17:06:28,242 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:28,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:28,298 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:28,299 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:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,303 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:28,396 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:28,396 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:28,419 INFO L420 sIntCurrentIteration]: We unified 222 AI predicates to 222 [2019-09-16 17:06:28,419 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-16 17:06:28,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:28,421 INFO L87 Difference]: Start difference. First operand 2692 states and 4026 transitions. Second operand 2 states. [2019-09-16 17:06:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,422 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:28,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:28,423 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 223 [2019-09-16 17:06:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,425 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:28,426 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:28,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 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:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:28,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-09-16 17:06:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,427 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:28,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:28,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:28,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:28 BoogieIcfgContainer [2019-09-16 17:06:28,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:28,437 INFO L168 Benchmark]: Toolchain (without parser) took 44401.03 ms. Allocated memory was 131.6 MB in the beginning and 790.6 MB in the end (delta: 659.0 MB). Free memory was 83.5 MB in the beginning and 348.7 MB in the end (delta: -265.1 MB). Peak memory consumption was 393.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:28,437 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 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:28,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.95 ms. Allocated memory was 131.6 MB in the beginning and 200.8 MB in the end (delta: 69.2 MB). Free memory was 83.1 MB in the beginning and 156.4 MB in the end (delta: -73.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:28,446 INFO L168 Benchmark]: Boogie Preprocessor took 191.41 ms. Allocated memory is still 200.8 MB. Free memory was 156.4 MB in the beginning and 148.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:28,449 INFO L168 Benchmark]: RCFGBuilder took 1720.43 ms. Allocated memory was 200.8 MB in the beginning and 221.8 MB in the end (delta: 21.0 MB). Free memory was 148.5 MB in the beginning and 166.4 MB in the end (delta: -17.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:28,451 INFO L168 Benchmark]: TraceAbstraction took 41582.22 ms. Allocated memory was 221.8 MB in the beginning and 790.6 MB in the end (delta: 568.9 MB). Free memory was 165.0 MB in the beginning and 348.7 MB in the end (delta: -183.7 MB). Peak memory consumption was 385.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:28,459 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.17 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 901.95 ms. Allocated memory was 131.6 MB in the beginning and 200.8 MB in the end (delta: 69.2 MB). Free memory was 83.1 MB in the beginning and 156.4 MB in the end (delta: -73.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.41 ms. Allocated memory is still 200.8 MB. Free memory was 156.4 MB in the beginning and 148.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1720.43 ms. Allocated memory was 200.8 MB in the beginning and 221.8 MB in the end (delta: 21.0 MB). Free memory was 148.5 MB in the beginning and 166.4 MB in the end (delta: -17.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41582.22 ms. Allocated memory was 221.8 MB in the beginning and 790.6 MB in the end (delta: 568.9 MB). Free memory was 165.0 MB in the beginning and 348.7 MB in the end (delta: -183.7 MB). Peak memory consumption was 385.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1726]: 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, 41.5s OverallTime, 89 OverallIterations, 8 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21142 SDtfs, 6167 SDslu, 28101 SDs, 0 SdLazy, 17763 SolverSat, 706 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 710 GetRequests, 418 SyntacticMatches, 48 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2692occurred in iteration=85, 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.2117117117117118 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 89 MinimizatonAttempts, 12764 StatesRemovedByMinimization, 85 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 11620 NumberOfCodeBlocks, 11620 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 11531 ConstructedInterpolants, 0 QuantifiedInterpolants, 3792607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 88 PerfectInterpolantSequences, 13510/13518 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...