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.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:05:09,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:09,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:09,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:09,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:09,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:09,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:09,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:09,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:09,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:09,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:09,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:09,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:09,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:09,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:09,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:09,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:09,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:09,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:09,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:09,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:09,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:09,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:09,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:09,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:09,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:09,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:09,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:09,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:09,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:09,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:09,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:09,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:09,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:09,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:09,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:09,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:09,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:09,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:09,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:09,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:09,146 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:09,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:09,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:09,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:09,184 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:09,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:09,184 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:09,185 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:09,185 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:09,190 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:09,191 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:09,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:09,193 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:09,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:09,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:09,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:09,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:09,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:09,194 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:09,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:09,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:09,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:09,195 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:09,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:09,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:09,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:09,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:09,196 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:09,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:09,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:09,198 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:09,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:09,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:09,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:09,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:09,279 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:09,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-2.c [2019-09-16 17:05:09,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cede5100/25a5957008c84f699a83642447fbaae0/FLAG3da0e7bca [2019-09-16 17:05:09,949 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:09,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-2.c [2019-09-16 17:05:09,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cede5100/25a5957008c84f699a83642447fbaae0/FLAG3da0e7bca [2019-09-16 17:05:10,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cede5100/25a5957008c84f699a83642447fbaae0 [2019-09-16 17:05:10,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:10,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:10,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:10,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:10,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:10,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:10" (1/1) ... [2019-09-16 17:05:10,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d4930b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:10, skipping insertion in model container [2019-09-16 17:05:10,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:10" (1/1) ... [2019-09-16 17:05:10,180 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:10,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:10,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:10,917 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:11,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:11,187 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:11,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:11 WrapperNode [2019-09-16 17:05:11,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:11,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:11,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:11,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:11,209 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:11" (1/1) ... [2019-09-16 17:05:11,212 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:11" (1/1) ... [2019-09-16 17:05:11,277 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:11" (1/1) ... [2019-09-16 17:05:11,278 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:11" (1/1) ... [2019-09-16 17:05:11,388 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:11" (1/1) ... [2019-09-16 17:05:11,403 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:11" (1/1) ... [2019-09-16 17:05:11,415 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:11" (1/1) ... [2019-09-16 17:05:11,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:11,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:11,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:11,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:11,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:11" (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:11,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:11,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:11,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:11,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:11,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:11,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:11,961 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:12,831 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:12,832 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:12,857 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:12,858 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:12,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:12 BoogieIcfgContainer [2019-09-16 17:05:12,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:12,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:12,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:12,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:12,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:10" (1/3) ... [2019-09-16 17:05:12,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dccc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:12, skipping insertion in model container [2019-09-16 17:05:12,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:11" (2/3) ... [2019-09-16 17:05:12,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dccc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:12, skipping insertion in model container [2019-09-16 17:05:12,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:12" (3/3) ... [2019-09-16 17:05:12,868 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-09-16 17:05:12,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:12,889 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:12,906 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:12,932 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:12,932 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:12,932 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:12,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:12,932 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:12,932 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:12,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:12,933 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-16 17:05:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 17:05:12,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,967 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,969 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -958109655, now seen corresponding path program 1 times [2019-09-16 17:05:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:13,382 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:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:13,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:13,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:13,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:13,411 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-09-16 17:05:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,894 INFO L93 Difference]: Finished difference Result 185 states and 300 transitions. [2019-09-16 17:05:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:13,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-16 17:05:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,910 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:05:13,910 INFO L226 Difference]: Without dead ends: 164 [2019-09-16 17:05:13,912 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:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-16 17:05:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-16 17:05:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-16 17:05:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-09-16 17:05:13,970 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2019-09-16 17:05:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,970 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-09-16 17:05:13,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-09-16 17:05:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:13,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:13,974 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:13,975 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -479309281, now seen corresponding path program 1 times [2019-09-16 17:05:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:14,179 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:14,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:14,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:14,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:14,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:14,185 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-09-16 17:05:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:14,613 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2019-09-16 17:05:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:14,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:14,616 INFO L225 Difference]: With dead ends: 164 [2019-09-16 17:05:14,616 INFO L226 Difference]: Without dead ends: 164 [2019-09-16 17:05:14,617 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:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-16 17:05:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-16 17:05:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-16 17:05:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-09-16 17:05:14,629 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2019-09-16 17:05:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:14,629 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-09-16 17:05:14,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-09-16 17:05:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:14,631 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:14,632 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:14,632 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash 242258695, now seen corresponding path program 1 times [2019-09-16 17:05:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:14,728 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:14,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:14,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:14,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:14,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:14,730 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-09-16 17:05:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:15,058 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-16 17:05:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:15,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:15,062 INFO L225 Difference]: With dead ends: 163 [2019-09-16 17:05:15,063 INFO L226 Difference]: Without dead ends: 163 [2019-09-16 17:05:15,063 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:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-16 17:05:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-09-16 17:05:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-16 17:05:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-09-16 17:05:15,086 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 65 [2019-09-16 17:05:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:15,086 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-09-16 17:05:15,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-09-16 17:05:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:15,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:15,089 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:15,089 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1080269467, now seen corresponding path program 1 times [2019-09-16 17:05:15,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:15,253 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:15,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:15,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:05:15,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:15,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:05:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:05:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:15,256 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 5 states. [2019-09-16 17:05:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:15,747 INFO L93 Difference]: Finished difference Result 168 states and 248 transitions. [2019-09-16 17:05:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:15,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-16 17:05:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:15,749 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:05:15,750 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:05:15,750 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:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:05:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-16 17:05:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-16 17:05:15,759 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2019-09-16 17:05:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:15,759 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-16 17:05:15,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:05:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-16 17:05:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:15,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:15,762 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:15,762 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash -639330733, now seen corresponding path program 1 times [2019-09-16 17:05:15,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:15,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:15,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:15,859 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:15,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:15,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:15,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:15,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:15,861 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2019-09-16 17:05:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:16,186 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-16 17:05:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:16,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:16,188 INFO L225 Difference]: With dead ends: 182 [2019-09-16 17:05:16,188 INFO L226 Difference]: Without dead ends: 182 [2019-09-16 17:05:16,189 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:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-16 17:05:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2019-09-16 17:05:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2019-09-16 17:05:16,200 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2019-09-16 17:05:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:16,201 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2019-09-16 17:05:16,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2019-09-16 17:05:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:05:16,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:16,203 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:16,203 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1139982254, now seen corresponding path program 1 times [2019-09-16 17:05:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:16,272 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:16,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:16,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:16,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:16,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:16,275 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2019-09-16 17:05:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:16,541 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-09-16 17:05:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:16,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:05:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:16,544 INFO L225 Difference]: With dead ends: 180 [2019-09-16 17:05:16,544 INFO L226 Difference]: Without dead ends: 180 [2019-09-16 17:05:16,544 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:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-16 17:05:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-16 17:05:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-16 17:05:16,550 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2019-09-16 17:05:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:16,551 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-16 17:05:16,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-16 17:05:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:05:16,552 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:16,553 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:16,553 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -447244068, now seen corresponding path program 1 times [2019-09-16 17:05:16,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:16,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:16,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:16,632 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:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:16,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:16,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:16,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:16,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:16,635 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2019-09-16 17:05:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:16,912 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2019-09-16 17:05:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:16,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:05:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:16,915 INFO L225 Difference]: With dead ends: 180 [2019-09-16 17:05:16,915 INFO L226 Difference]: Without dead ends: 180 [2019-09-16 17:05:16,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:05:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-16 17:05:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-16 17:05:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2019-09-16 17:05:16,921 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2019-09-16 17:05:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:16,922 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2019-09-16 17:05:16,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2019-09-16 17:05:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:05:16,924 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:16,924 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:16,924 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 144054159, now seen corresponding path program 1 times [2019-09-16 17:05:16,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:17,030 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:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:17,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:17,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:17,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:17,032 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2019-09-16 17:05:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:17,303 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2019-09-16 17:05:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:17,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:05:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:17,305 INFO L225 Difference]: With dead ends: 180 [2019-09-16 17:05:17,305 INFO L226 Difference]: Without dead ends: 180 [2019-09-16 17:05:17,306 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:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-16 17:05:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-16 17:05:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-09-16 17:05:17,311 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2019-09-16 17:05:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:17,311 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-09-16 17:05:17,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2019-09-16 17:05:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-16 17:05:17,313 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:17,313 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:17,313 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 91729367, now seen corresponding path program 1 times [2019-09-16 17:05:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:17,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:17,367 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:17,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:17,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:17,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:17,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:17,369 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2019-09-16 17:05:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:17,668 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2019-09-16 17:05:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:17,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-16 17:05:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:17,670 INFO L225 Difference]: With dead ends: 180 [2019-09-16 17:05:17,671 INFO L226 Difference]: Without dead ends: 180 [2019-09-16 17:05:17,671 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:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-16 17:05:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-16 17:05:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-16 17:05:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-09-16 17:05:17,677 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 68 [2019-09-16 17:05:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:17,678 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-09-16 17:05:17,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2019-09-16 17:05:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-16 17:05:17,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:17,679 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:17,679 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 952871030, now seen corresponding path program 1 times [2019-09-16 17:05:17,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:17,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:17,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:17,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:17,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:17,736 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:17,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:17,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:17,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:17,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:17,738 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand 4 states. [2019-09-16 17:05:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:18,014 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2019-09-16 17:05:18,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-16 17:05:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:18,016 INFO L225 Difference]: With dead ends: 210 [2019-09-16 17:05:18,016 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 17:05:18,017 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:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 17:05:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-16 17:05:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2019-09-16 17:05:18,023 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2019-09-16 17:05:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:18,024 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2019-09-16 17:05:18,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2019-09-16 17:05:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-16 17:05:18,025 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:18,025 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:18,026 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1561927466, now seen corresponding path program 1 times [2019-09-16 17:05:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:18,082 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:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:18,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:18,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:18,084 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2019-09-16 17:05:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:18,330 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2019-09-16 17:05:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:18,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-16 17:05:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:18,333 INFO L225 Difference]: With dead ends: 192 [2019-09-16 17:05:18,333 INFO L226 Difference]: Without dead ends: 192 [2019-09-16 17:05:18,334 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:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-16 17:05:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-16 17:05:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-09-16 17:05:18,341 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2019-09-16 17:05:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:18,341 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-09-16 17:05:18,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-09-16 17:05:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:18,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:18,344 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:18,344 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1661253362, now seen corresponding path program 1 times [2019-09-16 17:05:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:18,423 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:18,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:18,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:18,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:18,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:18,426 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2019-09-16 17:05:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:18,729 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2019-09-16 17:05:18,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:18,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:18,731 INFO L225 Difference]: With dead ends: 210 [2019-09-16 17:05:18,731 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 17:05:18,732 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:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 17:05:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-16 17:05:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2019-09-16 17:05:18,737 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2019-09-16 17:05:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:18,738 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2019-09-16 17:05:18,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2019-09-16 17:05:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:05:18,739 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:18,739 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:18,740 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1293601760, now seen corresponding path program 1 times [2019-09-16 17:05:18,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:18,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:18,796 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:18,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:18,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:18,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:18,798 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2019-09-16 17:05:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:19,061 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-16 17:05:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:19,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:05:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:19,063 INFO L225 Difference]: With dead ends: 209 [2019-09-16 17:05:19,064 INFO L226 Difference]: Without dead ends: 209 [2019-09-16 17:05:19,064 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:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-16 17:05:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-16 17:05:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2019-09-16 17:05:19,069 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2019-09-16 17:05:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:19,069 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2019-09-16 17:05:19,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2019-09-16 17:05:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:05:19,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:19,071 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:19,071 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 792950239, now seen corresponding path program 1 times [2019-09-16 17:05:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:19,137 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:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:19,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:19,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:19,138 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2019-09-16 17:05:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:19,405 INFO L93 Difference]: Finished difference Result 207 states and 299 transitions. [2019-09-16 17:05:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:19,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:05:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:19,407 INFO L225 Difference]: With dead ends: 207 [2019-09-16 17:05:19,407 INFO L226 Difference]: Without dead ends: 207 [2019-09-16 17:05:19,407 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:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-16 17:05:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-16 17:05:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2019-09-16 17:05:19,414 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2019-09-16 17:05:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:19,415 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2019-09-16 17:05:19,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2019-09-16 17:05:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:19,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:19,417 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:19,417 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:19,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -655878929, now seen corresponding path program 1 times [2019-09-16 17:05:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:19,532 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:19,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:19,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:19,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:19,534 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2019-09-16 17:05:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:19,824 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2019-09-16 17:05:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:19,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:05:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:19,826 INFO L225 Difference]: With dead ends: 207 [2019-09-16 17:05:19,826 INFO L226 Difference]: Without dead ends: 207 [2019-09-16 17:05:19,827 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:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-16 17:05:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-16 17:05:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2019-09-16 17:05:19,833 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2019-09-16 17:05:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:19,833 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2019-09-16 17:05:19,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2019-09-16 17:05:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-16 17:05:19,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:19,835 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:19,836 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2028659236, now seen corresponding path program 1 times [2019-09-16 17:05:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:19,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:19,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:19,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:19,938 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:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:19,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:19,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:19,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:19,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:19,942 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2019-09-16 17:05:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:20,215 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2019-09-16 17:05:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:20,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-16 17:05:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:20,217 INFO L225 Difference]: With dead ends: 207 [2019-09-16 17:05:20,217 INFO L226 Difference]: Without dead ends: 207 [2019-09-16 17:05:20,217 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:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-16 17:05:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-16 17:05:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2019-09-16 17:05:20,223 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2019-09-16 17:05:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:20,223 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2019-09-16 17:05:20,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2019-09-16 17:05:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-16 17:05:20,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:20,225 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:20,225 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1457090858, now seen corresponding path program 1 times [2019-09-16 17:05:20,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:20,277 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:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:20,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:20,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:20,279 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2019-09-16 17:05:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:20,544 INFO L93 Difference]: Finished difference Result 207 states and 296 transitions. [2019-09-16 17:05:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:20,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-16 17:05:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:20,545 INFO L225 Difference]: With dead ends: 207 [2019-09-16 17:05:20,546 INFO L226 Difference]: Without dead ends: 207 [2019-09-16 17:05:20,546 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:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-16 17:05:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-16 17:05:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2019-09-16 17:05:20,552 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2019-09-16 17:05:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:20,552 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2019-09-16 17:05:20,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-09-16 17:05:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-16 17:05:20,553 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:20,554 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:20,554 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:20,554 INFO L82 PathProgramCache]: Analyzing trace with hash 938460727, now seen corresponding path program 1 times [2019-09-16 17:05:20,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:20,623 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:20,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:20,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:20,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:20,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:20,625 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2019-09-16 17:05:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:20,933 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2019-09-16 17:05:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:20,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-16 17:05:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:20,936 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:05:20,936 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:05:20,936 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:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:05:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-09-16 17:05:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 17:05:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2019-09-16 17:05:20,944 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2019-09-16 17:05:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:20,945 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2019-09-16 17:05:20,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2019-09-16 17:05:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:05:20,947 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:20,947 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:20,948 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1406221366, now seen corresponding path program 1 times [2019-09-16 17:05:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:20,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:20,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:20,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,043 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:21,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:21,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:21,046 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2019-09-16 17:05:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:21,503 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2019-09-16 17:05:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:21,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:05:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:21,505 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:05:21,505 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:05:21,505 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:05:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-09-16 17:05:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 17:05:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-16 17:05:21,513 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2019-09-16 17:05:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:21,514 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-16 17:05:21,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-16 17:05:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:05:21,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:21,516 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:21,516 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1991352652, now seen corresponding path program 1 times [2019-09-16 17:05:21,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:21,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:21,627 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:21,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:21,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:21,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:21,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:21,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:21,629 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-16 17:05:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:21,990 INFO L93 Difference]: Finished difference Result 281 states and 421 transitions. [2019-09-16 17:05:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:21,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:05:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:21,993 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:21,993 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:21,994 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:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-16 17:05:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-16 17:05:22,005 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2019-09-16 17:05:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,006 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-16 17:05:22,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-16 17:05:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:22,008 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,008 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:22,011 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1233888286, now seen corresponding path program 1 times [2019-09-16 17:05:22,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,099 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:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:22,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:22,101 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-16 17:05:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,529 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-16 17:05:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:22,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,531 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:05:22,532 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:05:22,532 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:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:05:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2019-09-16 17:05:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-09-16 17:05:22,539 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2019-09-16 17:05:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,539 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-09-16 17:05:22,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-09-16 17:05:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:05:22,541 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,541 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:22,541 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1274563036, now seen corresponding path program 1 times [2019-09-16 17:05:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:22,612 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:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:22,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:22,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:22,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:22,613 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-09-16 17:05:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:22,944 INFO L93 Difference]: Finished difference Result 281 states and 419 transitions. [2019-09-16 17:05:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:22,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:05:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:22,950 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:05:22,950 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:05:22,951 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:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:05:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-16 17:05:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-09-16 17:05:22,955 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2019-09-16 17:05:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:22,956 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-09-16 17:05:22,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-09-16 17:05:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:22,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:22,957 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:22,957 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 930186292, now seen corresponding path program 1 times [2019-09-16 17:05:22,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:22,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,035 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:23,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,036 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-09-16 17:05:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:23,498 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-16 17:05:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:23,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:23,501 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:05:23,501 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:05:23,501 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:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:05:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2019-09-16 17:05:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-09-16 17:05:23,509 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2019-09-16 17:05:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:23,510 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-09-16 17:05:23,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-09-16 17:05:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:23,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:23,512 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:23,512 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 429534771, now seen corresponding path program 1 times [2019-09-16 17:05:23,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:23,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:23,590 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:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:23,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:23,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:23,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:23,594 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-09-16 17:05:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,052 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2019-09-16 17:05:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,056 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:24,056 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:24,057 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:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-16 17:05:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-09-16 17:05:24,064 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2019-09-16 17:05:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,065 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-09-16 17:05:24,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-09-16 17:05:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:24,066 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,066 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:24,067 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2103863754, now seen corresponding path program 1 times [2019-09-16 17:05:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,147 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:24,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,149 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-09-16 17:05:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,466 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-16 17:05:24,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,468 INFO L225 Difference]: With dead ends: 280 [2019-09-16 17:05:24,469 INFO L226 Difference]: Without dead ends: 280 [2019-09-16 17:05:24,469 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:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-16 17:05:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-16 17:05:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-09-16 17:05:24,475 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2019-09-16 17:05:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:24,476 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-09-16 17:05:24,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-09-16 17:05:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:24,477 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:24,478 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:24,478 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1690452021, now seen corresponding path program 1 times [2019-09-16 17:05:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:24,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:24,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:24,547 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:24,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:24,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:24,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:24,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:24,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:24,549 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-09-16 17:05:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:24,991 INFO L93 Difference]: Finished difference Result 278 states and 412 transitions. [2019-09-16 17:05:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:24,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:05:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:24,994 INFO L225 Difference]: With dead ends: 278 [2019-09-16 17:05:24,994 INFO L226 Difference]: Without dead ends: 278 [2019-09-16 17:05:24,994 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:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-16 17:05:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-16 17:05:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-09-16 17:05:25,001 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2019-09-16 17:05:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,002 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-09-16 17:05:25,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-09-16 17:05:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:25,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,003 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,004 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 963143451, now seen corresponding path program 1 times [2019-09-16 17:05:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:25,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,064 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-09-16 17:05:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,475 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-16 17:05:25,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,478 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:25,479 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:25,479 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:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-16 17:05:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-09-16 17:05:25,486 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2019-09-16 17:05:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,487 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-09-16 17:05:25,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-09-16 17:05:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:25,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,489 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,489 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1396872537, now seen corresponding path program 1 times [2019-09-16 17:05:25,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:25,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,572 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-09-16 17:05:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:25,879 INFO L93 Difference]: Finished difference Result 278 states and 410 transitions. [2019-09-16 17:05:25,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:25,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:05:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:25,882 INFO L225 Difference]: With dead ends: 278 [2019-09-16 17:05:25,882 INFO L226 Difference]: Without dead ends: 278 [2019-09-16 17:05:25,882 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-16 17:05:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-16 17:05:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-09-16 17:05:25,889 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2019-09-16 17:05:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:25,889 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-09-16 17:05:25,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-09-16 17:05:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:05:25,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:25,891 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:25,891 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash 916394288, now seen corresponding path program 1 times [2019-09-16 17:05:25,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:25,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:25,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:25,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:25,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:25,959 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-09-16 17:05:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,394 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-16 17:05:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:05:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,397 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:26,397 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:26,397 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:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-16 17:05:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-16 17:05:26,413 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2019-09-16 17:05:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-16 17:05:26,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-16 17:05:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:05:26,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,417 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:26,417 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1477094066, now seen corresponding path program 1 times [2019-09-16 17:05:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:26,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,511 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-09-16 17:05:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:26,847 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2019-09-16 17:05:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:26,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:05:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:26,849 INFO L225 Difference]: With dead ends: 278 [2019-09-16 17:05:26,850 INFO L226 Difference]: Without dead ends: 278 [2019-09-16 17:05:26,850 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-16 17:05:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-16 17:05:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-09-16 17:05:26,856 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2019-09-16 17:05:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-09-16 17:05:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-09-16 17:05:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:05:26,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:26,858 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:26,858 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1735530410, now seen corresponding path program 1 times [2019-09-16 17:05:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:26,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:26,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:26,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:26,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:26,922 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-09-16 17:05:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,293 INFO L93 Difference]: Finished difference Result 305 states and 443 transitions. [2019-09-16 17:05:27,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:05:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,296 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:05:27,296 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:05:27,297 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:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:05:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-16 17:05:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2019-09-16 17:05:27,304 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2019-09-16 17:05:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,304 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2019-09-16 17:05:27,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2019-09-16 17:05:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:05:27,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,306 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:27,306 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1533706476, now seen corresponding path program 1 times [2019-09-16 17:05:27,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:27,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,375 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2019-09-16 17:05:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:27,685 INFO L93 Difference]: Finished difference Result 278 states and 406 transitions. [2019-09-16 17:05:27,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:27,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:05:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:27,687 INFO L225 Difference]: With dead ends: 278 [2019-09-16 17:05:27,688 INFO L226 Difference]: Without dead ends: 278 [2019-09-16 17:05:27,688 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:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-16 17:05:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-16 17:05:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2019-09-16 17:05:27,695 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2019-09-16 17:05:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:27,695 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2019-09-16 17:05:27,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2019-09-16 17:05:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:05:27,697 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:27,697 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:27,697 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 751449227, now seen corresponding path program 1 times [2019-09-16 17:05:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:27,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:27,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:27,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:27,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:27,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:27,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:27,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:27,765 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2019-09-16 17:05:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,133 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2019-09-16 17:05:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-16 17:05:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,135 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:05:28,136 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:05:28,136 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:05:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-16 17:05:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2019-09-16 17:05:28,142 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2019-09-16 17:05:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,143 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2019-09-16 17:05:28,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2019-09-16 17:05:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:05:28,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,144 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:28,144 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1581943411, now seen corresponding path program 1 times [2019-09-16 17:05:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:28,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,211 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2019-09-16 17:05:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,462 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2019-09-16 17:05:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-16 17:05:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,464 INFO L225 Difference]: With dead ends: 268 [2019-09-16 17:05:28,464 INFO L226 Difference]: Without dead ends: 268 [2019-09-16 17:05:28,465 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-16 17:05:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2019-09-16 17:05:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2019-09-16 17:05:28,471 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2019-09-16 17:05:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,471 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2019-09-16 17:05:28,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2019-09-16 17:05:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:05:28,473 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,473 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:28,473 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash 697482930, now seen corresponding path program 1 times [2019-09-16 17:05:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:05:28,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:28,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:28,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:28,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:28,551 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2019-09-16 17:05:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:28,916 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2019-09-16 17:05:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:28,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-16 17:05:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:28,919 INFO L225 Difference]: With dead ends: 295 [2019-09-16 17:05:28,919 INFO L226 Difference]: Without dead ends: 295 [2019-09-16 17:05:28,919 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-16 17:05:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-16 17:05:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:05:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2019-09-16 17:05:28,924 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2019-09-16 17:05:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:28,925 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2019-09-16 17:05:28,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2019-09-16 17:05:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:05:28,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:28,926 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:28,927 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash -988696908, now seen corresponding path program 1 times [2019-09-16 17:05:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:28,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:28,991 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:05:28,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:28,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:28,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:28,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:28,993 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2019-09-16 17:05:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,016 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2019-09-16 17:05:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:29,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-16 17:05:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,019 INFO L225 Difference]: With dead ends: 485 [2019-09-16 17:05:29,019 INFO L226 Difference]: Without dead ends: 485 [2019-09-16 17:05:29,020 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:05:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-16 17:05:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-16 17:05:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-16 17:05:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2019-09-16 17:05:29,029 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2019-09-16 17:05:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,030 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2019-09-16 17:05:29,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2019-09-16 17:05:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-16 17:05:29,031 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,032 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:29,032 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 250169335, now seen corresponding path program 1 times [2019-09-16 17:05:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:05:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:29,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:29,105 INFO L87 Difference]: Start difference. First operand 485 states and 717 transitions. Second operand 3 states. [2019-09-16 17:05:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,134 INFO L93 Difference]: Finished difference Result 714 states and 1061 transitions. [2019-09-16 17:05:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:29,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-16 17:05:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,139 INFO L225 Difference]: With dead ends: 714 [2019-09-16 17:05:29,139 INFO L226 Difference]: Without dead ends: 714 [2019-09-16 17:05:29,139 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:05:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-16 17:05:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-09-16 17:05:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-16 17:05:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1061 transitions. [2019-09-16 17:05:29,158 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1061 transitions. Word has length 131 [2019-09-16 17:05:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,159 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1061 transitions. [2019-09-16 17:05:29,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1061 transitions. [2019-09-16 17:05:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-16 17:05:29,162 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,163 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:29,163 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 266552896, now seen corresponding path program 1 times [2019-09-16 17:05:29,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-16 17:05:29,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,299 INFO L87 Difference]: Start difference. First operand 714 states and 1061 transitions. Second operand 4 states. [2019-09-16 17:05:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:29,737 INFO L93 Difference]: Finished difference Result 1013 states and 1515 transitions. [2019-09-16 17:05:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:29,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-16 17:05:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:29,746 INFO L225 Difference]: With dead ends: 1013 [2019-09-16 17:05:29,746 INFO L226 Difference]: Without dead ends: 1013 [2019-09-16 17:05:29,746 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:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-16 17:05:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 780. [2019-09-16 17:05:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-16 17:05:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1172 transitions. [2019-09-16 17:05:29,763 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1172 transitions. Word has length 176 [2019-09-16 17:05:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:29,764 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1172 transitions. [2019-09-16 17:05:29,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1172 transitions. [2019-09-16 17:05:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-16 17:05:29,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:29,766 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:29,766 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1805534481, now seen corresponding path program 1 times [2019-09-16 17:05:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:29,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-16 17:05:29,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:29,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:29,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:29,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:29,863 INFO L87 Difference]: Start difference. First operand 780 states and 1172 transitions. Second operand 4 states. [2019-09-16 17:05:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,313 INFO L93 Difference]: Finished difference Result 998 states and 1489 transitions. [2019-09-16 17:05:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-16 17:05:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,318 INFO L225 Difference]: With dead ends: 998 [2019-09-16 17:05:30,318 INFO L226 Difference]: Without dead ends: 998 [2019-09-16 17:05:30,318 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:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-16 17:05:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 783. [2019-09-16 17:05:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1175 transitions. [2019-09-16 17:05:30,334 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1175 transitions. Word has length 177 [2019-09-16 17:05:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,335 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1175 transitions. [2019-09-16 17:05:30,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1175 transitions. [2019-09-16 17:05:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-16 17:05:30,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,337 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:30,338 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1080000358, now seen corresponding path program 1 times [2019-09-16 17:05:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:30,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:30,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:30,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:30,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:30,426 INFO L87 Difference]: Start difference. First operand 783 states and 1175 transitions. Second operand 4 states. [2019-09-16 17:05:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:30,877 INFO L93 Difference]: Finished difference Result 998 states and 1486 transitions. [2019-09-16 17:05:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:30,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-16 17:05:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:30,882 INFO L225 Difference]: With dead ends: 998 [2019-09-16 17:05:30,882 INFO L226 Difference]: Without dead ends: 998 [2019-09-16 17:05:30,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:05:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-16 17:05:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 783. [2019-09-16 17:05:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1172 transitions. [2019-09-16 17:05:30,899 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1172 transitions. Word has length 189 [2019-09-16 17:05:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:30,900 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1172 transitions. [2019-09-16 17:05:30,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1172 transitions. [2019-09-16 17:05:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-16 17:05:30,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:30,902 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:30,903 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2140603606, now seen corresponding path program 1 times [2019-09-16 17:05:30,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:30,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:31,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,020 INFO L87 Difference]: Start difference. First operand 783 states and 1172 transitions. Second operand 4 states. [2019-09-16 17:05:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:31,476 INFO L93 Difference]: Finished difference Result 995 states and 1480 transitions. [2019-09-16 17:05:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:31,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-16 17:05:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:31,482 INFO L225 Difference]: With dead ends: 995 [2019-09-16 17:05:31,482 INFO L226 Difference]: Without dead ends: 995 [2019-09-16 17:05:31,482 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:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-16 17:05:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 783. [2019-09-16 17:05:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1169 transitions. [2019-09-16 17:05:31,499 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1169 transitions. Word has length 190 [2019-09-16 17:05:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:31,499 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1169 transitions. [2019-09-16 17:05:31,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1169 transitions. [2019-09-16 17:05:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-16 17:05:31,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:31,502 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:31,502 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1459417801, now seen corresponding path program 1 times [2019-09-16 17:05:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:31,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:31,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:31,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:31,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:31,584 INFO L87 Difference]: Start difference. First operand 783 states and 1169 transitions. Second operand 4 states. [2019-09-16 17:05:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,003 INFO L93 Difference]: Finished difference Result 989 states and 1471 transitions. [2019-09-16 17:05:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-16 17:05:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,008 INFO L225 Difference]: With dead ends: 989 [2019-09-16 17:05:32,008 INFO L226 Difference]: Without dead ends: 989 [2019-09-16 17:05:32,008 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:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-16 17:05:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-16 17:05:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1166 transitions. [2019-09-16 17:05:32,022 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1166 transitions. Word has length 190 [2019-09-16 17:05:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,022 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1166 transitions. [2019-09-16 17:05:32,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1166 transitions. [2019-09-16 17:05:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-16 17:05:32,025 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,025 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,025 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1675897929, now seen corresponding path program 1 times [2019-09-16 17:05:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:32,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,107 INFO L87 Difference]: Start difference. First operand 783 states and 1166 transitions. Second operand 4 states. [2019-09-16 17:05:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,539 INFO L93 Difference]: Finished difference Result 989 states and 1468 transitions. [2019-09-16 17:05:32,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:32,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-09-16 17:05:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,543 INFO L225 Difference]: With dead ends: 989 [2019-09-16 17:05:32,543 INFO L226 Difference]: Without dead ends: 989 [2019-09-16 17:05:32,543 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:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-16 17:05:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-16 17:05:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1163 transitions. [2019-09-16 17:05:32,559 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1163 transitions. Word has length 191 [2019-09-16 17:05:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,559 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1163 transitions. [2019-09-16 17:05:32,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1163 transitions. [2019-09-16 17:05:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-16 17:05:32,561 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,562 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,562 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash -869515110, now seen corresponding path program 1 times [2019-09-16 17:05:32,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:32,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:32,666 INFO L87 Difference]: Start difference. First operand 783 states and 1163 transitions. Second operand 4 states. [2019-09-16 17:05:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,096 INFO L93 Difference]: Finished difference Result 989 states and 1465 transitions. [2019-09-16 17:05:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-16 17:05:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,100 INFO L225 Difference]: With dead ends: 989 [2019-09-16 17:05:33,100 INFO L226 Difference]: Without dead ends: 989 [2019-09-16 17:05:33,100 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-16 17:05:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-16 17:05:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1160 transitions. [2019-09-16 17:05:33,114 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1160 transitions. Word has length 192 [2019-09-16 17:05:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,115 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1160 transitions. [2019-09-16 17:05:33,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1160 transitions. [2019-09-16 17:05:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-16 17:05:33,117 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,117 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:33,117 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 910555054, now seen corresponding path program 1 times [2019-09-16 17:05:33,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,210 INFO L87 Difference]: Start difference. First operand 783 states and 1160 transitions. Second operand 4 states. [2019-09-16 17:05:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,639 INFO L93 Difference]: Finished difference Result 989 states and 1462 transitions. [2019-09-16 17:05:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:33,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-16 17:05:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,644 INFO L225 Difference]: With dead ends: 989 [2019-09-16 17:05:33,644 INFO L226 Difference]: Without dead ends: 989 [2019-09-16 17:05:33,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-16 17:05:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-16 17:05:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1157 transitions. [2019-09-16 17:05:33,658 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1157 transitions. Word has length 193 [2019-09-16 17:05:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,658 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1157 transitions. [2019-09-16 17:05:33,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1157 transitions. [2019-09-16 17:05:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-16 17:05:33,660 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:33,661 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:33,661 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2078842579, now seen corresponding path program 1 times [2019-09-16 17:05:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:33,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:33,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:33,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:33,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:33,749 INFO L87 Difference]: Start difference. First operand 783 states and 1157 transitions. Second operand 4 states. [2019-09-16 17:05:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,170 INFO L93 Difference]: Finished difference Result 989 states and 1459 transitions. [2019-09-16 17:05:34,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-16 17:05:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,175 INFO L225 Difference]: With dead ends: 989 [2019-09-16 17:05:34,175 INFO L226 Difference]: Without dead ends: 989 [2019-09-16 17:05:34,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-16 17:05:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 783. [2019-09-16 17:05:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1154 transitions. [2019-09-16 17:05:34,186 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1154 transitions. Word has length 193 [2019-09-16 17:05:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,187 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1154 transitions. [2019-09-16 17:05:34,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1154 transitions. [2019-09-16 17:05:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-16 17:05:34,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,189 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:34,190 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -658348961, now seen corresponding path program 1 times [2019-09-16 17:05:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:34,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,278 INFO L87 Difference]: Start difference. First operand 783 states and 1154 transitions. Second operand 4 states. [2019-09-16 17:05:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:34,678 INFO L93 Difference]: Finished difference Result 959 states and 1420 transitions. [2019-09-16 17:05:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:34,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-16 17:05:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:34,682 INFO L225 Difference]: With dead ends: 959 [2019-09-16 17:05:34,682 INFO L226 Difference]: Without dead ends: 959 [2019-09-16 17:05:34,683 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-16 17:05:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 783. [2019-09-16 17:05:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1151 transitions. [2019-09-16 17:05:34,692 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1151 transitions. Word has length 194 [2019-09-16 17:05:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:34,693 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1151 transitions. [2019-09-16 17:05:34,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1151 transitions. [2019-09-16 17:05:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-16 17:05:34,695 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:34,695 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:34,696 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1544069447, now seen corresponding path program 1 times [2019-09-16 17:05:34,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:34,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:34,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:34,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:34,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:34,807 INFO L87 Difference]: Start difference. First operand 783 states and 1151 transitions. Second operand 4 states. [2019-09-16 17:05:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,203 INFO L93 Difference]: Finished difference Result 959 states and 1417 transitions. [2019-09-16 17:05:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-16 17:05:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,211 INFO L225 Difference]: With dead ends: 959 [2019-09-16 17:05:35,212 INFO L226 Difference]: Without dead ends: 959 [2019-09-16 17:05:35,212 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:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-16 17:05:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 783. [2019-09-16 17:05:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1148 transitions. [2019-09-16 17:05:35,223 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1148 transitions. Word has length 194 [2019-09-16 17:05:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,224 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1148 transitions. [2019-09-16 17:05:35,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1148 transitions. [2019-09-16 17:05:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-16 17:05:35,226 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,226 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:35,226 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1748280760, now seen corresponding path program 1 times [2019-09-16 17:05:35,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,319 INFO L87 Difference]: Start difference. First operand 783 states and 1148 transitions. Second operand 4 states. [2019-09-16 17:05:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:35,715 INFO L93 Difference]: Finished difference Result 950 states and 1402 transitions. [2019-09-16 17:05:35,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:35,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-16 17:05:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:35,720 INFO L225 Difference]: With dead ends: 950 [2019-09-16 17:05:35,720 INFO L226 Difference]: Without dead ends: 950 [2019-09-16 17:05:35,721 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:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-16 17:05:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 783. [2019-09-16 17:05:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:05:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1145 transitions. [2019-09-16 17:05:35,730 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1145 transitions. Word has length 195 [2019-09-16 17:05:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:35,730 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1145 transitions. [2019-09-16 17:05:35,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1145 transitions. [2019-09-16 17:05:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-16 17:05:35,732 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:35,732 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:05:35,732 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash 972184600, now seen corresponding path program 2 times [2019-09-16 17:05:35,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:35,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:05:35,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:35,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:35,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:35,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:35,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:35,832 INFO L87 Difference]: Start difference. First operand 783 states and 1145 transitions. Second operand 4 states. [2019-09-16 17:05:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,254 INFO L93 Difference]: Finished difference Result 950 states and 1399 transitions. [2019-09-16 17:05:36,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-09-16 17:05:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,260 INFO L225 Difference]: With dead ends: 950 [2019-09-16 17:05:36,260 INFO L226 Difference]: Without dead ends: 950 [2019-09-16 17:05:36,260 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-16 17:05:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 786. [2019-09-16 17:05:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-16 17:05:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1148 transitions. [2019-09-16 17:05:36,270 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1148 transitions. Word has length 198 [2019-09-16 17:05:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,270 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1148 transitions. [2019-09-16 17:05:36,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1148 transitions. [2019-09-16 17:05:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-16 17:05:36,272 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,272 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,272 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1406306023, now seen corresponding path program 1 times [2019-09-16 17:05:36,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:05:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:05:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,366 INFO L87 Difference]: Start difference. First operand 786 states and 1148 transitions. Second operand 4 states. [2019-09-16 17:05:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:36,760 INFO L93 Difference]: Finished difference Result 938 states and 1381 transitions. [2019-09-16 17:05:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-16 17:05:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:36,765 INFO L225 Difference]: With dead ends: 938 [2019-09-16 17:05:36,765 INFO L226 Difference]: Without dead ends: 938 [2019-09-16 17:05:36,765 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-16 17:05:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 789. [2019-09-16 17:05:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-16 17:05:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1151 transitions. [2019-09-16 17:05:36,794 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1151 transitions. Word has length 199 [2019-09-16 17:05:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:36,794 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1151 transitions. [2019-09-16 17:05:36,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1151 transitions. [2019-09-16 17:05:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-16 17:05:36,796 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:36,796 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:36,796 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:36,797 INFO L82 PathProgramCache]: Analyzing trace with hash -328133693, now seen corresponding path program 1 times [2019-09-16 17:05:36,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:36,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:36,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:36,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:36,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:36,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:36,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:36,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:36,890 INFO L87 Difference]: Start difference. First operand 789 states and 1151 transitions. Second operand 4 states. [2019-09-16 17:05:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,266 INFO L93 Difference]: Finished difference Result 938 states and 1378 transitions. [2019-09-16 17:05:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-09-16 17:05:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,271 INFO L225 Difference]: With dead ends: 938 [2019-09-16 17:05:37,271 INFO L226 Difference]: Without dead ends: 938 [2019-09-16 17:05:37,272 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:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-16 17:05:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 798. [2019-09-16 17:05:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-09-16 17:05:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1166 transitions. [2019-09-16 17:05:37,281 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1166 transitions. Word has length 201 [2019-09-16 17:05:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 798 states and 1166 transitions. [2019-09-16 17:05:37,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1166 transitions. [2019-09-16 17:05:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-16 17:05:37,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,284 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,284 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1720230956, now seen corresponding path program 1 times [2019-09-16 17:05:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,371 INFO L87 Difference]: Start difference. First operand 798 states and 1166 transitions. Second operand 4 states. [2019-09-16 17:05:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:37,723 INFO L93 Difference]: Finished difference Result 914 states and 1336 transitions. [2019-09-16 17:05:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:37,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-09-16 17:05:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:37,728 INFO L225 Difference]: With dead ends: 914 [2019-09-16 17:05:37,728 INFO L226 Difference]: Without dead ends: 914 [2019-09-16 17:05:37,729 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:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-16 17:05:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 801. [2019-09-16 17:05:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-09-16 17:05:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2019-09-16 17:05:37,740 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 202 [2019-09-16 17:05:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:37,740 INFO L475 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2019-09-16 17:05:37,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2019-09-16 17:05:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-16 17:05:37,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:37,742 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:37,742 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1971718935, now seen corresponding path program 1 times [2019-09-16 17:05:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:37,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:37,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:37,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:37,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:37,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:37,844 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 4 states. [2019-09-16 17:05:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,210 INFO L93 Difference]: Finished difference Result 914 states and 1333 transitions. [2019-09-16 17:05:38,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-16 17:05:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,213 INFO L225 Difference]: With dead ends: 914 [2019-09-16 17:05:38,214 INFO L226 Difference]: Without dead ends: 914 [2019-09-16 17:05:38,214 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:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-16 17:05:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 804. [2019-09-16 17:05:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-16 17:05:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1172 transitions. [2019-09-16 17:05:38,227 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1172 transitions. Word has length 203 [2019-09-16 17:05:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,227 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1172 transitions. [2019-09-16 17:05:38,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1172 transitions. [2019-09-16 17:05:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-16 17:05:38,229 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,229 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,230 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1994072257, now seen corresponding path program 1 times [2019-09-16 17:05:38,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,319 INFO L87 Difference]: Start difference. First operand 804 states and 1172 transitions. Second operand 4 states. [2019-09-16 17:05:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:38,686 INFO L93 Difference]: Finished difference Result 914 states and 1330 transitions. [2019-09-16 17:05:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:38,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-16 17:05:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:38,690 INFO L225 Difference]: With dead ends: 914 [2019-09-16 17:05:38,690 INFO L226 Difference]: Without dead ends: 914 [2019-09-16 17:05:38,691 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:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-16 17:05:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 804. [2019-09-16 17:05:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-16 17:05:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1169 transitions. [2019-09-16 17:05:38,703 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1169 transitions. Word has length 204 [2019-09-16 17:05:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:38,704 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1169 transitions. [2019-09-16 17:05:38,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1169 transitions. [2019-09-16 17:05:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-16 17:05:38,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:38,706 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:38,706 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1276535462, now seen corresponding path program 1 times [2019-09-16 17:05:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:38,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:38,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:38,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:38,801 INFO L87 Difference]: Start difference. First operand 804 states and 1169 transitions. Second operand 4 states. [2019-09-16 17:05:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,141 INFO L93 Difference]: Finished difference Result 908 states and 1321 transitions. [2019-09-16 17:05:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-16 17:05:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,143 INFO L225 Difference]: With dead ends: 908 [2019-09-16 17:05:39,144 INFO L226 Difference]: Without dead ends: 908 [2019-09-16 17:05:39,144 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:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-16 17:05:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 807. [2019-09-16 17:05:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-16 17:05:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1172 transitions. [2019-09-16 17:05:39,155 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1172 transitions. Word has length 204 [2019-09-16 17:05:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,155 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1172 transitions. [2019-09-16 17:05:39,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1172 transitions. [2019-09-16 17:05:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-16 17:05:39,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,157 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,157 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 213776304, now seen corresponding path program 1 times [2019-09-16 17:05:39,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,249 INFO L87 Difference]: Start difference. First operand 807 states and 1172 transitions. Second operand 4 states. [2019-09-16 17:05:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:39,575 INFO L93 Difference]: Finished difference Result 902 states and 1309 transitions. [2019-09-16 17:05:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:39,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-16 17:05:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:39,579 INFO L225 Difference]: With dead ends: 902 [2019-09-16 17:05:39,579 INFO L226 Difference]: Without dead ends: 902 [2019-09-16 17:05:39,580 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:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-16 17:05:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 807. [2019-09-16 17:05:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-16 17:05:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1169 transitions. [2019-09-16 17:05:39,592 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1169 transitions. Word has length 205 [2019-09-16 17:05:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:39,592 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1169 transitions. [2019-09-16 17:05:39,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1169 transitions. [2019-09-16 17:05:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-16 17:05:39,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:39,595 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:39,595 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 136522315, now seen corresponding path program 1 times [2019-09-16 17:05:39,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:39,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:39,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:39,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:39,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:39,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:39,694 INFO L87 Difference]: Start difference. First operand 807 states and 1169 transitions. Second operand 4 states. [2019-09-16 17:05:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,009 INFO L93 Difference]: Finished difference Result 893 states and 1294 transitions. [2019-09-16 17:05:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-09-16 17:05:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,012 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:05:40,012 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:05:40,013 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:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:05:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 810. [2019-09-16 17:05:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-09-16 17:05:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1172 transitions. [2019-09-16 17:05:40,023 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1172 transitions. Word has length 205 [2019-09-16 17:05:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,024 INFO L475 AbstractCegarLoop]: Abstraction has 810 states and 1172 transitions. [2019-09-16 17:05:40,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1172 transitions. [2019-09-16 17:05:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-16 17:05:40,026 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,026 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,027 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1480087122, now seen corresponding path program 1 times [2019-09-16 17:05:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,132 INFO L87 Difference]: Start difference. First operand 810 states and 1172 transitions. Second operand 4 states. [2019-09-16 17:05:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,489 INFO L93 Difference]: Finished difference Result 893 states and 1291 transitions. [2019-09-16 17:05:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-09-16 17:05:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,491 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:05:40,491 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:05:40,492 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:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:05:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 813. [2019-09-16 17:05:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-09-16 17:05:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1175 transitions. [2019-09-16 17:05:40,501 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1175 transitions. Word has length 207 [2019-09-16 17:05:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,501 INFO L475 AbstractCegarLoop]: Abstraction has 813 states and 1175 transitions. [2019-09-16 17:05:40,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1175 transitions. [2019-09-16 17:05:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-16 17:05:40,503 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,503 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,503 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1180339750, now seen corresponding path program 1 times [2019-09-16 17:05:40,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:40,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:40,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:40,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:40,592 INFO L87 Difference]: Start difference. First operand 813 states and 1175 transitions. Second operand 4 states. [2019-09-16 17:05:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:40,896 INFO L93 Difference]: Finished difference Result 881 states and 1273 transitions. [2019-09-16 17:05:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:40,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-16 17:05:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:40,899 INFO L225 Difference]: With dead ends: 881 [2019-09-16 17:05:40,899 INFO L226 Difference]: Without dead ends: 881 [2019-09-16 17:05:40,899 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:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-16 17:05:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 816. [2019-09-16 17:05:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-16 17:05:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1178 transitions. [2019-09-16 17:05:40,907 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1178 transitions. Word has length 208 [2019-09-16 17:05:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:40,907 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1178 transitions. [2019-09-16 17:05:40,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1178 transitions. [2019-09-16 17:05:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-16 17:05:40,908 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:40,909 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:40,909 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1818139356, now seen corresponding path program 1 times [2019-09-16 17:05:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:40,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:41,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,001 INFO L87 Difference]: Start difference. First operand 816 states and 1178 transitions. Second operand 4 states. [2019-09-16 17:05:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,309 INFO L93 Difference]: Finished difference Result 881 states and 1270 transitions. [2019-09-16 17:05:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-16 17:05:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,312 INFO L225 Difference]: With dead ends: 881 [2019-09-16 17:05:41,312 INFO L226 Difference]: Without dead ends: 881 [2019-09-16 17:05:41,312 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:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-16 17:05:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 819. [2019-09-16 17:05:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-09-16 17:05:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1181 transitions. [2019-09-16 17:05:41,321 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1181 transitions. Word has length 208 [2019-09-16 17:05:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,321 INFO L475 AbstractCegarLoop]: Abstraction has 819 states and 1181 transitions. [2019-09-16 17:05:41,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1181 transitions. [2019-09-16 17:05:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-16 17:05:41,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,322 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,323 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1649918744, now seen corresponding path program 1 times [2019-09-16 17:05:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:41,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,432 INFO L87 Difference]: Start difference. First operand 819 states and 1181 transitions. Second operand 4 states. [2019-09-16 17:05:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:41,710 INFO L93 Difference]: Finished difference Result 875 states and 1261 transitions. [2019-09-16 17:05:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:41,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-09-16 17:05:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:41,713 INFO L225 Difference]: With dead ends: 875 [2019-09-16 17:05:41,714 INFO L226 Difference]: Without dead ends: 875 [2019-09-16 17:05:41,714 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:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-09-16 17:05:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 822. [2019-09-16 17:05:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-09-16 17:05:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1184 transitions. [2019-09-16 17:05:41,724 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1184 transitions. Word has length 209 [2019-09-16 17:05:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:41,725 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1184 transitions. [2019-09-16 17:05:41,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1184 transitions. [2019-09-16 17:05:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:05:41,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:41,727 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:41,727 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1379723895, now seen corresponding path program 1 times [2019-09-16 17:05:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:41,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:41,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:41,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:41,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:41,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:41,842 INFO L87 Difference]: Start difference. First operand 822 states and 1184 transitions. Second operand 4 states. [2019-09-16 17:05:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,160 INFO L93 Difference]: Finished difference Result 875 states and 1258 transitions. [2019-09-16 17:05:42,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-16 17:05:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,163 INFO L225 Difference]: With dead ends: 875 [2019-09-16 17:05:42,163 INFO L226 Difference]: Without dead ends: 875 [2019-09-16 17:05:42,163 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:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-09-16 17:05:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2019-09-16 17:05:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-16 17:05:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1187 transitions. [2019-09-16 17:05:42,173 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1187 transitions. Word has length 210 [2019-09-16 17:05:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,174 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1187 transitions. [2019-09-16 17:05:42,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1187 transitions. [2019-09-16 17:05:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-16 17:05:42,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,178 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,178 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1295312669, now seen corresponding path program 1 times [2019-09-16 17:05:42,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:42,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,326 INFO L87 Difference]: Start difference. First operand 825 states and 1187 transitions. Second operand 4 states. [2019-09-16 17:05:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:42,618 INFO L93 Difference]: Finished difference Result 869 states and 1249 transitions. [2019-09-16 17:05:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:42,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-09-16 17:05:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:42,621 INFO L225 Difference]: With dead ends: 869 [2019-09-16 17:05:42,622 INFO L226 Difference]: Without dead ends: 869 [2019-09-16 17:05:42,622 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:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-09-16 17:05:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 828. [2019-09-16 17:05:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-16 17:05:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1190 transitions. [2019-09-16 17:05:42,633 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1190 transitions. Word has length 211 [2019-09-16 17:05:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:42,633 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1190 transitions. [2019-09-16 17:05:42,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1190 transitions. [2019-09-16 17:05:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-16 17:05:42,635 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:42,636 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:42,636 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash 561210642, now seen corresponding path program 1 times [2019-09-16 17:05:42,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:42,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:42,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:42,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:42,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:42,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:42,759 INFO L87 Difference]: Start difference. First operand 828 states and 1190 transitions. Second operand 4 states. [2019-09-16 17:05:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,044 INFO L93 Difference]: Finished difference Result 869 states and 1246 transitions. [2019-09-16 17:05:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-09-16 17:05:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,046 INFO L225 Difference]: With dead ends: 869 [2019-09-16 17:05:43,046 INFO L226 Difference]: Without dead ends: 869 [2019-09-16 17:05:43,046 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:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-09-16 17:05:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 831. [2019-09-16 17:05:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-16 17:05:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1193 transitions. [2019-09-16 17:05:43,058 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1193 transitions. Word has length 214 [2019-09-16 17:05:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,058 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1193 transitions. [2019-09-16 17:05:43,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1193 transitions. [2019-09-16 17:05:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-16 17:05:43,060 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,060 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:43,061 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash 72336710, now seen corresponding path program 1 times [2019-09-16 17:05:43,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-16 17:05:43,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:43,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:43,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:43,189 INFO L87 Difference]: Start difference. First operand 831 states and 1193 transitions. Second operand 4 states. [2019-09-16 17:05:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,488 INFO L93 Difference]: Finished difference Result 860 states and 1231 transitions. [2019-09-16 17:05:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:43,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-09-16 17:05:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,491 INFO L225 Difference]: With dead ends: 860 [2019-09-16 17:05:43,491 INFO L226 Difference]: Without dead ends: 860 [2019-09-16 17:05:43,491 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:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-09-16 17:05:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 834. [2019-09-16 17:05:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-09-16 17:05:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1196 transitions. [2019-09-16 17:05:43,503 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1196 transitions. Word has length 215 [2019-09-16 17:05:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,503 INFO L475 AbstractCegarLoop]: Abstraction has 834 states and 1196 transitions. [2019-09-16 17:05:43,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1196 transitions. [2019-09-16 17:05:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-16 17:05:43,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:43,506 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:05:43,507 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1912192128, now seen corresponding path program 1 times [2019-09-16 17:05:43,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:43,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:43,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:43,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 168 proven. 57 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-16 17:05:43,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:43,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:43,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2019-09-16 17:05:43,670 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [330], [333], [341], [344], [346], [348], [350], [353], [362], [525], [530], [533], [541], [546], [548], [551], [553], [558], [561], [565], [586], [620], [622], [634], [637], [638], [650], [658], [659], [660] [2019-09-16 17:05:43,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:05:43,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:05:43,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:05:43,840 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:05:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:43,844 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:05:43,914 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:05:43,914 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:05:43,920 INFO L420 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2019-09-16 17:05:43,921 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:05:43,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:43,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-16 17:05:43,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:43,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:05:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:05:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:43,925 INFO L87 Difference]: Start difference. First operand 834 states and 1196 transitions. Second operand 2 states. [2019-09-16 17:05:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:43,925 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:05:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:05:43,926 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 219 [2019-09-16 17:05:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:43,926 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:05:43,926 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:43,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 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:05:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:43,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-09-16 17:05:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:43,927 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:43,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:05:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:43,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:43,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:43 BoogieIcfgContainer [2019-09-16 17:05:43,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:43,935 INFO L168 Benchmark]: Toolchain (without parser) took 33777.43 ms. Allocated memory was 140.0 MB in the beginning and 667.4 MB in the end (delta: 527.4 MB). Free memory was 85.1 MB in the beginning and 108.8 MB in the end (delta: -23.7 MB). Peak memory consumption was 503.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,935 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1026.06 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 84.9 MB in the beginning and 155.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,936 INFO L168 Benchmark]: Boogie Preprocessor took 247.71 ms. Allocated memory is still 200.8 MB. Free memory was 155.6 MB in the beginning and 147.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,937 INFO L168 Benchmark]: RCFGBuilder took 1423.15 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 147.9 MB in the beginning and 167.5 MB in the end (delta: -19.6 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,938 INFO L168 Benchmark]: TraceAbstraction took 31071.49 ms. Allocated memory was 225.4 MB in the beginning and 667.4 MB in the end (delta: 442.0 MB). Free memory was 167.5 MB in the beginning and 108.8 MB in the end (delta: 58.7 MB). Peak memory consumption was 500.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:43,940 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.97 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1026.06 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 84.9 MB in the beginning and 155.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 247.71 ms. Allocated memory is still 200.8 MB. Free memory was 155.6 MB in the beginning and 147.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1423.15 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 147.9 MB in the beginning and 167.5 MB in the end (delta: -19.6 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31071.49 ms. Allocated memory was 225.4 MB in the beginning and 667.4 MB in the end (delta: 442.0 MB). Free memory was 167.5 MB in the beginning and 108.8 MB in the end (delta: 58.7 MB). Peak memory consumption was 500.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1702]: 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, 181 locations, 1 error locations. SAFE Result, 31.0s OverallTime, 67 OverallIterations, 7 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14385 SDtfs, 4056 SDslu, 20336 SDs, 0 SdLazy, 13141 SolverSat, 470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 356 SyntacticMatches, 31 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=834occurred in iteration=66, 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.2477064220183487 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 67 MinimizatonAttempts, 4770 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 9301 NumberOfCodeBlocks, 9301 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 9234 ConstructedInterpolants, 0 QuantifiedInterpolants, 3106030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 66 PerfectInterpolantSequences, 11894/11951 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...