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.13.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:30,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:30,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:30,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:30,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:30,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:30,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:30,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:30,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:30,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:30,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:30,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:30,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:30,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:30,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:30,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:30,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:30,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:30,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:30,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:30,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:30,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:30,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:30,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:30,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:30,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:30,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:30,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:30,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:30,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:30,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:30,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:30,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:30,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:30,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:30,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:30,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:30,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:30,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:30,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:30,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:30,714 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-09 05:54:30,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:30,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:30,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:30,734 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:30,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:30,735 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:30,735 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:30,735 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:30,736 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:30,736 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:30,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:30,737 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:30,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:30,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:30,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:30,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:30,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:30,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:30,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:30,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:30,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:30,739 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:30,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:30,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:30,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:30,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:30,740 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:30,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:30,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:30,740 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:30,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:30,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:30,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:30,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:30,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:30,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.13.i.cil-2.c [2019-09-09 05:54:30,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c659f29e/00bcf8cbb7214965a65a8f81cdf24652/FLAGded880ba1 [2019-09-09 05:54:31,502 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:31,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.13.i.cil-2.c [2019-09-09 05:54:31,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c659f29e/00bcf8cbb7214965a65a8f81cdf24652/FLAGded880ba1 [2019-09-09 05:54:31,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c659f29e/00bcf8cbb7214965a65a8f81cdf24652 [2019-09-09 05:54:31,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:31,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:31,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:31,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:31,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:31,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:31" (1/1) ... [2019-09-09 05:54:31,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356139cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:31, skipping insertion in model container [2019-09-09 05:54:31,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:31" (1/1) ... [2019-09-09 05:54:31,752 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:31,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:32,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:32,432 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:32,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:32,655 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:32,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32 WrapperNode [2019-09-09 05:54:32,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:32,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:32,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:32,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:32,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (1/1) ... [2019-09-09 05:54:32,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:32,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:32,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:32,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:32,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (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-09 05:54:32,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:32,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:32,932 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:32,932 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:32,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:32,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:32,935 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:32,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:33,473 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:34,185 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:34,186 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:34,226 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:34,226 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:34,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:34 BoogieIcfgContainer [2019-09-09 05:54:34,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:34,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:34,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:34,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:34,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:31" (1/3) ... [2019-09-09 05:54:34,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:34, skipping insertion in model container [2019-09-09 05:54:34,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:32" (2/3) ... [2019-09-09 05:54:34,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:34, skipping insertion in model container [2019-09-09 05:54:34,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:34" (3/3) ... [2019-09-09 05:54:34,237 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-09-09 05:54:34,249 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:34,259 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:34,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:34,304 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:34,304 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:34,304 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:34,304 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:34,305 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:34,305 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:34,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:34,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-09 05:54:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-09 05:54:34,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:34,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:34,343 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1489368308, now seen corresponding path program 1 times [2019-09-09 05:54:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:34,773 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-09 05:54:34,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:34,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:34,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:34,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:34,805 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-09 05:54:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,355 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-09 05:54:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-09 05:54:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,377 INFO L225 Difference]: With dead ends: 190 [2019-09-09 05:54:35,378 INFO L226 Difference]: Without dead ends: 169 [2019-09-09 05:54:35,382 INFO L628 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-09 05:54:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-09 05:54:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-09 05:54:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:54:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-09 05:54:35,459 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-09 05:54:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,460 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-09 05:54:35,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-09 05:54:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:54:35,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,464 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,465 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 380678987, now seen corresponding path program 1 times [2019-09-09 05:54:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:35,611 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-09 05:54:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:35,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:35,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:35,619 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-09 05:54:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,028 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-09 05:54:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-09 05:54:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,030 INFO L225 Difference]: With dead ends: 169 [2019-09-09 05:54:36,031 INFO L226 Difference]: Without dead ends: 169 [2019-09-09 05:54:36,032 INFO L628 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-09 05:54:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-09 05:54:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-09 05:54:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:54:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-09 05:54:36,045 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-09 05:54:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,045 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-09 05:54:36,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-09 05:54:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:54:36,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,053 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,053 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1401722649, now seen corresponding path program 1 times [2019-09-09 05:54:36,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,182 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-09 05:54:36,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,184 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-09 05:54:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,476 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-09 05:54:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:54:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,479 INFO L225 Difference]: With dead ends: 168 [2019-09-09 05:54:36,479 INFO L226 Difference]: Without dead ends: 168 [2019-09-09 05:54:36,479 INFO L628 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-09 05:54:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-09 05:54:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-09 05:54:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:54:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-09 05:54:36,488 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-09 05:54:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,489 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-09 05:54:36,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-09 05:54:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:54:36,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,492 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash -536143493, now seen corresponding path program 1 times [2019-09-09 05:54:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,587 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-09 05:54:36,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:36,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:36,589 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-09 05:54:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,110 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-09 05:54:37,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:37,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-09 05:54:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,112 INFO L225 Difference]: With dead ends: 173 [2019-09-09 05:54:37,112 INFO L226 Difference]: Without dead ends: 173 [2019-09-09 05:54:37,113 INFO L628 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-09 05:54:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-09 05:54:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-09 05:54:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-09 05:54:37,135 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-09 05:54:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,136 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-09 05:54:37,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-09 05:54:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:54:37,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,140 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,140 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash -358032589, now seen corresponding path program 1 times [2019-09-09 05:54:37,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,259 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-09 05:54:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,263 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-09 05:54:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,586 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-09 05:54:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:54:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,588 INFO L225 Difference]: With dead ends: 187 [2019-09-09 05:54:37,588 INFO L226 Difference]: Without dead ends: 187 [2019-09-09 05:54:37,589 INFO L628 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-09 05:54:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-09 05:54:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-09 05:54:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-09 05:54:37,603 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-09 05:54:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,604 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-09 05:54:37,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-09 05:54:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:54:37,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,613 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,614 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1285498866, now seen corresponding path program 1 times [2019-09-09 05:54:37,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,751 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-09 05:54:37,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,766 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-09 05:54:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,103 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-09 05:54:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:54:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,108 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:54:38,109 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:54:38,109 INFO L628 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-09 05:54:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:54:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:54:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-09 05:54:38,118 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-09 05:54:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,119 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-09 05:54:38,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-09 05:54:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:54:38,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,122 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,123 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1797335240, now seen corresponding path program 1 times [2019-09-09 05:54:38,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,235 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-09 05:54:38,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,237 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-09 05:54:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,501 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-09 05:54:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-09 05:54:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,504 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:54:38,504 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:54:38,505 INFO L628 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-09 05:54:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:54:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:54:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-09 05:54:38,511 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-09 05:54:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,511 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-09 05:54:38,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-09 05:54:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:54:38,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,513 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,513 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1679814895, now seen corresponding path program 1 times [2019-09-09 05:54:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,611 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-09 05:54:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,615 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-09 05:54:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,878 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-09 05:54:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-09 05:54:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,880 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:54:38,880 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:54:38,880 INFO L628 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-09 05:54:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:54:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:54:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-09 05:54:38,889 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-09 05:54:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,889 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-09 05:54:38,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-09 05:54:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:54:38,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,890 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,891 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1049616899, now seen corresponding path program 1 times [2019-09-09 05:54:38,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,977 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-09 05:54:38,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,979 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-09 05:54:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,263 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-09 05:54:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 05:54:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,265 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:54:39,265 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:54:39,266 INFO L628 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-09 05:54:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:54:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-09 05:54:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:54:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-09 05:54:39,272 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-09 05:54:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,273 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-09 05:54:39,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-09 05:54:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:54:39,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,274 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,274 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1277180062, now seen corresponding path program 1 times [2019-09-09 05:54:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,347 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-09 05:54:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,348 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-09 05:54:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,792 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-09 05:54:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 05:54:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,794 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:54:39,794 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:54:39,794 INFO L628 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-09 05:54:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:54:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-09 05:54:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-09 05:54:39,801 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-09 05:54:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,802 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-09 05:54:39,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-09 05:54:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:54:39,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,803 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,803 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1706280906, now seen corresponding path program 1 times [2019-09-09 05:54:39,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,855 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-09 05:54:39,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,856 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-09 05:54:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,097 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-09 05:54:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-09 05:54:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,100 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:54:40,100 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:54:40,100 INFO L628 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-09 05:54:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:54:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-09 05:54:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-09 05:54:40,106 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-09 05:54:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,107 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-09 05:54:40,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-09 05:54:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-09 05:54:40,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,108 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,108 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1052652213, now seen corresponding path program 1 times [2019-09-09 05:54:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,166 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-09 05:54:40,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:40,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:40,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:40,168 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-09 05:54:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,507 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-09 05:54:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-09 05:54:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,510 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:54:40,510 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:54:40,510 INFO L628 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-09 05:54:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:54:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-09 05:54:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-09 05:54:40,517 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-09 05:54:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,518 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-09 05:54:40,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-09 05:54:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:54:40,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,520 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,520 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1001699063, now seen corresponding path program 1 times [2019-09-09 05:54:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,597 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-09 05:54:40,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:40,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:40,599 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-09 05:54:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,925 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-09 05:54:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-09 05:54:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,927 INFO L225 Difference]: With dead ends: 213 [2019-09-09 05:54:40,928 INFO L226 Difference]: Without dead ends: 213 [2019-09-09 05:54:40,928 INFO L628 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-09 05:54:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-09 05:54:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-09 05:54:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-09 05:54:40,934 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-09 05:54:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,934 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-09 05:54:40,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-09 05:54:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:54:40,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,936 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash 641832392, now seen corresponding path program 1 times [2019-09-09 05:54:40,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,999 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-09 05:54:41,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,001 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-09 05:54:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:41,277 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-09 05:54:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:41,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-09 05:54:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:41,279 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:41,279 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:41,280 INFO L628 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-09 05:54:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:54:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-09 05:54:41,286 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-09 05:54:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:41,286 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-09 05:54:41,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-09 05:54:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:54:41,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:41,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:41,288 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash -976456270, now seen corresponding path program 1 times [2019-09-09 05:54:41,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:41,354 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-09 05:54:41,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,356 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-09 05:54:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:41,668 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-09 05:54:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:41,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-09 05:54:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:41,671 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:41,671 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:41,671 INFO L628 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-09 05:54:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:54:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-09 05:54:41,677 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-09 05:54:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:41,678 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-09 05:54:41,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-09 05:54:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-09 05:54:41,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:41,679 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:41,679 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1591624005, now seen corresponding path program 1 times [2019-09-09 05:54:41,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:41,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:41,742 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-09 05:54:41,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:41,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:41,744 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-09 05:54:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,024 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-09 05:54:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:42,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-09 05:54:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,025 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:42,026 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:42,026 INFO L628 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-09 05:54:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:54:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-09 05:54:42,030 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-09 05:54:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,030 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-09 05:54:42,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-09 05:54:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:54:42,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,032 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:42,032 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1684300691, now seen corresponding path program 1 times [2019-09-09 05:54:42,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,093 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-09 05:54:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:42,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:42,123 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-09 05:54:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,427 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-09 05:54:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:42,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-09 05:54:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,429 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:42,430 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:42,430 INFO L628 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-09 05:54:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-09 05:54:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-09 05:54:42,437 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-09 05:54:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,437 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-09 05:54:42,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-09 05:54:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:54:42,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,439 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:42,439 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785760, now seen corresponding path program 1 times [2019-09-09 05:54:42,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,509 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-09 05:54:42,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:42,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:42,511 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-09 05:54:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,781 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-09 05:54:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:42,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-09 05:54:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,783 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:54:42,783 INFO L226 Difference]: Without dead ends: 201 [2019-09-09 05:54:42,784 INFO L628 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-09 05:54:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-09 05:54:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-09 05:54:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-09 05:54:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-09 05:54:42,790 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-09 05:54:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,790 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-09 05:54:42,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-09 05:54:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:42,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,791 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:42,792 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 164825720, now seen corresponding path program 1 times [2019-09-09 05:54:42,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,883 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-09 05:54:42,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:42,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:42,887 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-09 05:54:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:43,350 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-09 05:54:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:43,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:43,353 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:54:43,353 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:54:43,354 INFO L628 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-09 05:54:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:54:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-09 05:54:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-09 05:54:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-09 05:54:43,361 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-09 05:54:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:43,361 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-09 05:54:43,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-09 05:54:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:43,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:43,362 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:43,363 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash 92439162, now seen corresponding path program 1 times [2019-09-09 05:54:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:43,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:43,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:43,422 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-09 05:54:43,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:43,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:43,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:43,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:43,423 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-09 05:54:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:43,738 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-09 05:54:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:43,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:43,740 INFO L225 Difference]: With dead ends: 273 [2019-09-09 05:54:43,740 INFO L226 Difference]: Without dead ends: 273 [2019-09-09 05:54:43,741 INFO L628 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-09 05:54:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-09 05:54:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-09 05:54:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-09 05:54:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-09 05:54:43,748 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-09 05:54:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:43,748 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-09 05:54:43,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-09 05:54:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:43,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:43,750 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:43,750 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:43,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1395813593, now seen corresponding path program 1 times [2019-09-09 05:54:43,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:43,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:43,822 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-09 05:54:43,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:43,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:43,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:43,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:43,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:43,824 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-09 05:54:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,291 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-09 05:54:44,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:44,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:44,294 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:54:44,294 INFO L226 Difference]: Without dead ends: 316 [2019-09-09 05:54:44,295 INFO L628 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-09 05:54:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-09 05:54:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-09 05:54:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-09 05:54:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-09 05:54:44,302 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-09 05:54:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:44,302 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-09 05:54:44,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-09 05:54:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:54:44,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:44,304 INFO L399 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] [2019-09-09 05:54:44,304 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1346211210, now seen corresponding path program 1 times [2019-09-09 05:54:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:44,380 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-09 05:54:44,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:44,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:44,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:44,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:44,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:44,381 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-09 05:54:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,887 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-09 05:54:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:44,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-09 05:54:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:44,893 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:54:44,893 INFO L226 Difference]: Without dead ends: 316 [2019-09-09 05:54:44,893 INFO L628 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-09 05:54:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-09 05:54:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-09 05:54:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-09 05:54:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-09 05:54:44,905 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-09 05:54:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:44,906 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-09 05:54:44,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-09 05:54:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:44,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:44,909 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:44,910 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1209790738, now seen corresponding path program 1 times [2019-09-09 05:54:44,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,012 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-09 05:54:45,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:45,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:45,014 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-09 05:54:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:45,403 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-09 05:54:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:45,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,406 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:45,406 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:45,408 INFO L628 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-09 05:54:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-09 05:54:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-09 05:54:45,416 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-09 05:54:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:45,416 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-09 05:54:45,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-09 05:54:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-09 05:54:45,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,418 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:45,418 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -528538785, now seen corresponding path program 1 times [2019-09-09 05:54:45,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,485 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-09 05:54:45,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:45,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:45,488 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-09 05:54:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:45,898 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-09 05:54:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:45,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-09 05:54:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,901 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:54:45,901 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:54:45,903 INFO L628 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-09 05:54:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:54:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-09 05:54:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-09 05:54:45,917 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-09 05:54:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:45,917 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-09 05:54:45,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-09 05:54:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-09 05:54:45,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,920 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:45,920 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1399733917, now seen corresponding path program 1 times [2019-09-09 05:54:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,025 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-09 05:54:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,028 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-09 05:54:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,448 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-09 05:54:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-09 05:54:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,451 INFO L225 Difference]: With dead ends: 285 [2019-09-09 05:54:46,451 INFO L226 Difference]: Without dead ends: 285 [2019-09-09 05:54:46,451 INFO L628 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-09 05:54:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-09 05:54:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-09 05:54:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-09 05:54:46,458 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-09 05:54:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,459 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-09 05:54:46,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-09 05:54:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:46,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,461 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,461 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1520987551, now seen corresponding path program 1 times [2019-09-09 05:54:46,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,526 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-09 05:54:46,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,530 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-09 05:54:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:46,908 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-09 05:54:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:46,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:46,912 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:54:46,912 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:54:46,912 INFO L628 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-09 05:54:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:54:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-09 05:54:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-09 05:54:46,919 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-09 05:54:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:46,920 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-09 05:54:46,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-09 05:54:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:46,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:46,921 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:46,921 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1130448290, now seen corresponding path program 1 times [2019-09-09 05:54:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:46,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:46,981 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-09 05:54:46,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:46,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:46,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:46,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:46,982 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-09 05:54:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,366 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-09 05:54:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,369 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:47,369 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:47,370 INFO L628 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-09 05:54:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-09 05:54:47,376 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-09 05:54:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,377 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-09 05:54:47,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-09 05:54:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:47,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,378 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,378 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1167899169, now seen corresponding path program 1 times [2019-09-09 05:54:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,448 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-09 05:54:47,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,450 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-09 05:54:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,731 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-09 05:54:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:47,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,734 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:54:47,734 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:54:47,735 INFO L628 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-09 05:54:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:54:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-09 05:54:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-09 05:54:47,741 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-09 05:54:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,741 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-09 05:54:47,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-09 05:54:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:54:47,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,743 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:47,743 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1483536672, now seen corresponding path program 1 times [2019-09-09 05:54:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,808 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-09 05:54:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:47,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:47,810 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,144 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-09 05:54:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-09 05:54:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,147 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:48,148 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:48,148 INFO L628 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-09 05:54:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-09 05:54:48,154 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-09 05:54:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,155 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-09 05:54:48,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-09 05:54:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 05:54:48,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,156 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,156 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -82582564, now seen corresponding path program 1 times [2019-09-09 05:54:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,214 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-09 05:54:48,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,216 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-09 05:54:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,571 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-09 05:54:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-09 05:54:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,575 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:48,575 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:48,576 INFO L628 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-09 05:54:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-09 05:54:48,582 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-09 05:54:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,582 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-09 05:54:48,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-09 05:54:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 05:54:48,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,584 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,584 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579482, now seen corresponding path program 1 times [2019-09-09 05:54:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:48,640 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-09 05:54:48,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:48,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:48,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:48,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:48,642 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-09 05:54:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:48,928 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-09 05:54:48,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:48,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-09 05:54:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:48,931 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:48,931 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:48,931 INFO L628 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-09 05:54:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-09 05:54:48,938 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-09 05:54:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:48,938 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-09 05:54:48,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-09 05:54:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:54:48,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:48,940 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:48,940 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -763062181, now seen corresponding path program 1 times [2019-09-09 05:54:48,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:48,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,008 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-09 05:54:49,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,009 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-09 05:54:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,370 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-09 05:54:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-09 05:54:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,374 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:49,374 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:49,375 INFO L628 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-09 05:54:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-09 05:54:49,384 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-09 05:54:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,384 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-09 05:54:49,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-09 05:54:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:54:49,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,385 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,386 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -778580899, now seen corresponding path program 1 times [2019-09-09 05:54:49,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,439 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-09 05:54:49,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,444 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-09 05:54:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:49,750 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-09 05:54:49,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:49,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-09 05:54:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:49,753 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:49,753 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:49,754 INFO L628 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-09 05:54:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-09 05:54:49,760 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-09 05:54:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,760 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-09 05:54:49,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-09 05:54:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:54:49,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,762 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,762 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1665128425, now seen corresponding path program 1 times [2019-09-09 05:54:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,849 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-09 05:54:49,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:49,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:49,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:49,851 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-09 05:54:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,292 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-09 05:54:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-09 05:54:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,294 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:54:50,294 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:54:50,294 INFO L628 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-09 05:54:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:54:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-09 05:54:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-09 05:54:50,301 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-09 05:54:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,301 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-09 05:54:50,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-09 05:54:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:54:50,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,302 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,303 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2146208683, now seen corresponding path program 1 times [2019-09-09 05:54:50,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,367 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-09 05:54:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,368 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-09 05:54:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:50,677 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-09 05:54:50,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:50,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-09 05:54:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:50,680 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:50,680 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:50,680 INFO L628 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-09 05:54:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-09 05:54:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-09 05:54:50,685 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-09 05:54:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:50,685 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-09 05:54:50,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-09 05:54:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:54:50,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:50,687 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:50,687 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -846445514, now seen corresponding path program 1 times [2019-09-09 05:54:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:50,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,750 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-09 05:54:50,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:50,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:50,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:50,754 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-09 05:54:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,104 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-09 05:54:51,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-09 05:54:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,107 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:54:51,107 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:54:51,108 INFO L628 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-09 05:54:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:54:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-09 05:54:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-09 05:54:51,113 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-09 05:54:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,113 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-09 05:54:51,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-09 05:54:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:54:51,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,114 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,115 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1419935672, now seen corresponding path program 1 times [2019-09-09 05:54:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,173 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-09 05:54:51,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,176 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-09 05:54:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,445 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-09 05:54:51,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-09 05:54:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,448 INFO L225 Difference]: With dead ends: 272 [2019-09-09 05:54:51,448 INFO L226 Difference]: Without dead ends: 272 [2019-09-09 05:54:51,449 INFO L628 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-09 05:54:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-09 05:54:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-09 05:54:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-09 05:54:51,454 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-09 05:54:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,455 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-09 05:54:51,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-09 05:54:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:51,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,456 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,456 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 228784092, now seen corresponding path program 1 times [2019-09-09 05:54:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,527 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-09 05:54:51,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:51,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:51,529 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-09 05:54:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:51,895 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-09 05:54:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:51,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:51,898 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:54:51,899 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:54:51,899 INFO L628 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-09 05:54:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:54:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-09 05:54:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:54:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-09 05:54:51,905 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-09 05:54:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:51,906 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-09 05:54:51,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-09 05:54:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:51,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:51,907 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:51,907 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1615569502, now seen corresponding path program 1 times [2019-09-09 05:54:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:51,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:51,972 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-09 05:54:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:51,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:51,974 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-09 05:54:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,021 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-09 05:54:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:52,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-09 05:54:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,024 INFO L225 Difference]: With dead ends: 493 [2019-09-09 05:54:52,024 INFO L226 Difference]: Without dead ends: 493 [2019-09-09 05:54:52,025 INFO L628 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-09 05:54:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-09 05:54:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-09 05:54:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-09 05:54:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-09 05:54:52,036 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-09 05:54:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,036 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-09 05:54:52,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-09 05:54:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:52,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,038 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,039 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash -929123768, now seen corresponding path program 1 times [2019-09-09 05:54:52,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:52,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:52,116 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-09 05:54:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,213 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-09 05:54:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:52,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-09 05:54:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,217 INFO L225 Difference]: With dead ends: 728 [2019-09-09 05:54:52,218 INFO L226 Difference]: Without dead ends: 728 [2019-09-09 05:54:52,218 INFO L628 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-09 05:54:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-09 05:54:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-09 05:54:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-09 05:54:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-09 05:54:52,229 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-09 05:54:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,230 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-09 05:54:52,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-09 05:54:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:54:52,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,232 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,232 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 369425990, now seen corresponding path program 1 times [2019-09-09 05:54:52,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:52,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:52,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:52,296 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-09 05:54:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,352 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-09 05:54:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:52,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-09 05:54:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,357 INFO L225 Difference]: With dead ends: 961 [2019-09-09 05:54:52,357 INFO L226 Difference]: Without dead ends: 961 [2019-09-09 05:54:52,357 INFO L628 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-09 05:54:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-09 05:54:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-09 05:54:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-09 05:54:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-09 05:54:52,373 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-09 05:54:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,374 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-09 05:54:52,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-09 05:54:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:54:52,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,377 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,377 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2133236826, now seen corresponding path program 1 times [2019-09-09 05:54:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:52,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:52,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:52,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:52,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:52,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:52,448 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-09 05:54:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,911 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-09 05:54:52,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:52,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:54:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,917 INFO L225 Difference]: With dead ends: 1369 [2019-09-09 05:54:52,918 INFO L226 Difference]: Without dead ends: 1369 [2019-09-09 05:54:52,918 INFO L628 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-09 05:54:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-09 05:54:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-09 05:54:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-09 05:54:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-09 05:54:52,936 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-09 05:54:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:52,937 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-09 05:54:52,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-09 05:54:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:54:52,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:52,940 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:52,940 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1698497454, now seen corresponding path program 1 times [2019-09-09 05:54:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:52,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:53,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,019 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-09 05:54:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,478 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-09 05:54:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:53,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:54:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,483 INFO L225 Difference]: With dead ends: 1351 [2019-09-09 05:54:53,483 INFO L226 Difference]: Without dead ends: 1351 [2019-09-09 05:54:53,484 INFO L628 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-09 05:54:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-09 05:54:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-09 05:54:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-09 05:54:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-09 05:54:53,502 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-09 05:54:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,503 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-09 05:54:53,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-09 05:54:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 05:54:53,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,506 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,506 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash -502838968, now seen corresponding path program 1 times [2019-09-09 05:54:53,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:54:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:53,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:53,575 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-09 05:54:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:53,628 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-09 05:54:53,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:53,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-09 05:54:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:53,634 INFO L225 Difference]: With dead ends: 1339 [2019-09-09 05:54:53,635 INFO L226 Difference]: Without dead ends: 1339 [2019-09-09 05:54:53,635 INFO L628 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-09 05:54:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-09 05:54:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-09 05:54:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-09 05:54:53,662 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-09 05:54:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:53,662 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-09 05:54:53,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-09 05:54:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:54:53,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:53,667 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:53,667 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash 682232505, now seen corresponding path program 1 times [2019-09-09 05:54:53,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:53,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:53,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:53,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:53,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:53,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:53,742 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-09 05:54:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,224 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-09 05:54:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:54:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,232 INFO L225 Difference]: With dead ends: 1682 [2019-09-09 05:54:54,232 INFO L226 Difference]: Without dead ends: 1682 [2019-09-09 05:54:54,232 INFO L628 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-09 05:54:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-09 05:54:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-09 05:54:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-09 05:54:54,251 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-09 05:54:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,251 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-09 05:54:54,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-09 05:54:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:54:54,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,255 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,255 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1599625407, now seen corresponding path program 1 times [2019-09-09 05:54:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,324 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-09 05:54:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:54,752 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-09 05:54:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:54,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:54:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:54,759 INFO L225 Difference]: With dead ends: 1677 [2019-09-09 05:54:54,760 INFO L226 Difference]: Without dead ends: 1677 [2019-09-09 05:54:54,760 INFO L628 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-09 05:54:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-09 05:54:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-09 05:54:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-09 05:54:54,779 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-09 05:54:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:54,780 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-09 05:54:54,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-09 05:54:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:54:54,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:54,783 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:54,783 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 58403008, now seen corresponding path program 1 times [2019-09-09 05:54:54,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:54,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:54,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:54,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:54,847 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-09 05:54:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,287 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-09 05:54:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:54:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,293 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:55,293 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:55,294 INFO L628 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-09 05:54:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-09 05:54:55,312 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-09 05:54:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,313 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-09 05:54:55,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-09 05:54:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:55,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,316 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,316 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1044774282, now seen corresponding path program 1 times [2019-09-09 05:54:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:55,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,379 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-09 05:54:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:55,801 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-09 05:54:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:55,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:55,812 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:55,812 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:55,813 INFO L628 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-09 05:54:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-09 05:54:55,833 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-09 05:54:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:55,834 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-09 05:54:55,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-09 05:54:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:55,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:55,836 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:55,836 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1179079683, now seen corresponding path program 1 times [2019-09-09 05:54:55,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:55,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:55,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:55,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:55,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:55,910 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-09 05:54:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,380 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-09 05:54:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,391 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:56,391 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:56,392 INFO L628 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-09 05:54:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-09 05:54:56,406 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-09 05:54:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,406 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-09 05:54:56,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-09 05:54:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:54:56,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,409 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,409 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1625618289, now seen corresponding path program 1 times [2019-09-09 05:54:56,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:56,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:56,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:56,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:56,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:56,484 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-09 05:54:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:56,901 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-09 05:54:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:56,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:54:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:56,910 INFO L225 Difference]: With dead ends: 1667 [2019-09-09 05:54:56,910 INFO L226 Difference]: Without dead ends: 1667 [2019-09-09 05:54:56,910 INFO L628 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-09 05:54:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-09 05:54:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-09 05:54:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-09 05:54:56,929 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-09 05:54:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,930 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-09 05:54:56,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-09 05:54:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:54:56,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,932 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,933 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1050140312, now seen corresponding path program 1 times [2019-09-09 05:54:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:57,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,006 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-09 05:54:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,406 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-09 05:54:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:54:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,422 INFO L225 Difference]: With dead ends: 1617 [2019-09-09 05:54:57,423 INFO L226 Difference]: Without dead ends: 1617 [2019-09-09 05:54:57,423 INFO L628 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-09 05:54:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-09 05:54:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-09 05:54:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-09 05:54:57,446 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-09 05:54:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,447 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-09 05:54:57,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-09 05:54:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:54:57,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,451 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,451 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1657295938, now seen corresponding path program 1 times [2019-09-09 05:54:57,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:57,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:57,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:57,531 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-09 05:54:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:57,931 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-09 05:54:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:57,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:54:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:57,937 INFO L225 Difference]: With dead ends: 1617 [2019-09-09 05:54:57,937 INFO L226 Difference]: Without dead ends: 1617 [2019-09-09 05:54:57,938 INFO L628 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-09 05:54:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-09 05:54:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-09 05:54:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-09 05:54:57,954 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-09 05:54:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:57,954 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-09 05:54:57,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-09 05:54:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:54:57,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:57,957 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:57,957 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash -459540457, now seen corresponding path program 1 times [2019-09-09 05:54:57,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:57,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:58,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,034 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-09 05:54:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,433 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-09 05:54:58,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:54:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,437 INFO L225 Difference]: With dead ends: 1592 [2019-09-09 05:54:58,438 INFO L226 Difference]: Without dead ends: 1592 [2019-09-09 05:54:58,438 INFO L628 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-09 05:54:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-09 05:54:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-09 05:54:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-09 05:54:58,454 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-09 05:54:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,455 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-09 05:54:58,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-09 05:54:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:54:58,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:58,457 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:58,458 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1308556535, now seen corresponding path program 1 times [2019-09-09 05:54:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:58,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:58,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:58,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:58,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:58,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:58,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:58,573 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-09 05:54:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,972 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-09 05:54:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:58,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:54:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,976 INFO L225 Difference]: With dead ends: 1592 [2019-09-09 05:54:58,977 INFO L226 Difference]: Without dead ends: 1592 [2019-09-09 05:54:58,977 INFO L628 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-09 05:54:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-09 05:54:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-09 05:54:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-09 05:54:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-09 05:54:58,999 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-09 05:54:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:58,999 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-09 05:54:58,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-09 05:54:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:59,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,004 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,005 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1355244734, now seen corresponding path program 1 times [2019-09-09 05:54:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,098 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:54:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:59,454 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-09 05:54:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:59,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:59,457 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:54:59,457 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:54:59,459 INFO L628 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-09 05:54:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:54:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-09 05:54:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-09 05:54:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-09 05:54:59,475 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-09 05:54:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:59,476 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-09 05:54:59,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-09 05:54:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:59,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:59,479 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:59,479 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash -245297578, now seen corresponding path program 1 times [2019-09-09 05:54:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:59,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:59,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:59,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:59,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:59,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:59,569 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-09 05:55:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,084 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-09 05:55:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,088 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:55:00,088 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:55:00,089 INFO L628 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-09 05:55:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:55:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-09 05:55:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-09 05:55:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-09 05:55:00,105 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-09 05:55:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,105 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-09 05:55:00,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-09 05:55:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:00,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,108 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,108 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash -304506221, now seen corresponding path program 1 times [2019-09-09 05:55:00,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:00,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,198 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:55:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:00,557 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-09 05:55:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:00,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:00,560 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:55:00,560 INFO L226 Difference]: Without dead ends: 1552 [2019-09-09 05:55:00,560 INFO L628 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-09 05:55:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-09 05:55:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-09 05:55:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-09 05:55:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-09 05:55:00,577 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-09 05:55:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,577 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-09 05:55:00,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-09 05:55:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:00,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,580 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,580 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash -698012739, now seen corresponding path program 1 times [2019-09-09 05:55:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:00,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:00,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:00,667 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-09 05:55:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,124 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-09 05:55:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,128 INFO L225 Difference]: With dead ends: 1542 [2019-09-09 05:55:01,128 INFO L226 Difference]: Without dead ends: 1542 [2019-09-09 05:55:01,128 INFO L628 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-09 05:55:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-09 05:55:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-09 05:55:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-09 05:55:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-09 05:55:01,144 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-09 05:55:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,145 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-09 05:55:01,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-09 05:55:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:01,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,147 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,148 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2086211788, now seen corresponding path program 1 times [2019-09-09 05:55:01,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,227 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:55:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,567 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-09 05:55:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,571 INFO L225 Difference]: With dead ends: 1532 [2019-09-09 05:55:01,571 INFO L226 Difference]: Without dead ends: 1532 [2019-09-09 05:55:01,572 INFO L628 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-09 05:55:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-09 05:55:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-09 05:55:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-09 05:55:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-09 05:55:01,588 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-09 05:55:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:01,588 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-09 05:55:01,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-09 05:55:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:01,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:01,591 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:01,591 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -960768076, now seen corresponding path program 1 times [2019-09-09 05:55:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:01,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:01,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:01,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:01,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:01,672 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-09 05:55:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:01,980 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-09 05:55:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:01,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:01,983 INFO L225 Difference]: With dead ends: 1517 [2019-09-09 05:55:01,984 INFO L226 Difference]: Without dead ends: 1517 [2019-09-09 05:55:01,984 INFO L628 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-09 05:55:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-09 05:55:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-09 05:55:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-09 05:55:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-09 05:55:02,001 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-09 05:55:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,001 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-09 05:55:02,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-09 05:55:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:02,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,004 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,004 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2014185627, now seen corresponding path program 1 times [2019-09-09 05:55:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,084 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-09 05:55:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,414 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-09 05:55:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,417 INFO L225 Difference]: With dead ends: 1517 [2019-09-09 05:55:02,418 INFO L226 Difference]: Without dead ends: 1517 [2019-09-09 05:55:02,418 INFO L628 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-09 05:55:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-09 05:55:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-09 05:55:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-09 05:55:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-09 05:55:02,434 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-09 05:55:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,434 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-09 05:55:02,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-09 05:55:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:02,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,437 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,437 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1202525105, now seen corresponding path program 1 times [2019-09-09 05:55:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,523 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-09 05:55:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:02,840 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-09 05:55:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:02,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:02,842 INFO L225 Difference]: With dead ends: 1497 [2019-09-09 05:55:02,842 INFO L226 Difference]: Without dead ends: 1497 [2019-09-09 05:55:02,843 INFO L628 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-09 05:55:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-09 05:55:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-09 05:55:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-09 05:55:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-09 05:55:02,853 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-09 05:55:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:02,854 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-09 05:55:02,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-09 05:55:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:02,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:02,856 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:02,856 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1712961357, now seen corresponding path program 1 times [2019-09-09 05:55:02,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:02,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:02,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:02,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:02,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:02,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:02,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:02,968 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-09 05:55:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,301 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-09 05:55:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,303 INFO L225 Difference]: With dead ends: 1497 [2019-09-09 05:55:03,304 INFO L226 Difference]: Without dead ends: 1497 [2019-09-09 05:55:03,304 INFO L628 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-09 05:55:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-09 05:55:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-09 05:55:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-09 05:55:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-09 05:55:03,323 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-09 05:55:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,323 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-09 05:55:03,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-09 05:55:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:55:03,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,329 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,329 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1145389383, now seen corresponding path program 1 times [2019-09-09 05:55:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:03,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,438 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-09 05:55:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:03,748 INFO L93 Difference]: Finished difference Result 1487 states and 2130 transitions. [2019-09-09 05:55:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:03,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:55:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:03,751 INFO L225 Difference]: With dead ends: 1487 [2019-09-09 05:55:03,751 INFO L226 Difference]: Without dead ends: 1487 [2019-09-09 05:55:03,752 INFO L628 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-09 05:55:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-09 05:55:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2019-09-09 05:55:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-09 05:55:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-09 05:55:03,766 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-09 05:55:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:03,766 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-09 05:55:03,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-09 05:55:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:55:03,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:03,769 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:03,769 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1245927820, now seen corresponding path program 1 times [2019-09-09 05:55:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:03,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:03,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:03,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:03,854 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-09 05:55:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,187 INFO L93 Difference]: Finished difference Result 1487 states and 2125 transitions. [2019-09-09 05:55:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:55:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,189 INFO L225 Difference]: With dead ends: 1487 [2019-09-09 05:55:04,189 INFO L226 Difference]: Without dead ends: 1487 [2019-09-09 05:55:04,189 INFO L628 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-09 05:55:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-09 05:55:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2019-09-09 05:55:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-09 05:55:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-09 05:55:04,200 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2019-09-09 05:55:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,200 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-09 05:55:04,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-09 05:55:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:04,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,202 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,203 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1883212056, now seen corresponding path program 1 times [2019-09-09 05:55:04,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:04,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,279 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-09 05:55:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:04,580 INFO L93 Difference]: Finished difference Result 1467 states and 2097 transitions. [2019-09-09 05:55:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:04,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:04,582 INFO L225 Difference]: With dead ends: 1467 [2019-09-09 05:55:04,582 INFO L226 Difference]: Without dead ends: 1467 [2019-09-09 05:55:04,583 INFO L628 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-09 05:55:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-09 05:55:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2019-09-09 05:55:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-09 05:55:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-09 05:55:04,598 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2019-09-09 05:55:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:04,598 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-09 05:55:04,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-09 05:55:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:04,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:04,601 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:04,601 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -648127340, now seen corresponding path program 1 times [2019-09-09 05:55:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:04,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:04,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:04,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:04,701 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 4 states. [2019-09-09 05:55:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:05,068 INFO L93 Difference]: Finished difference Result 1697 states and 2463 transitions. [2019-09-09 05:55:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:05,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:55:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:05,071 INFO L225 Difference]: With dead ends: 1697 [2019-09-09 05:55:05,071 INFO L226 Difference]: Without dead ends: 1697 [2019-09-09 05:55:05,071 INFO L628 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-09 05:55:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-09 05:55:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1522. [2019-09-09 05:55:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-09-09 05:55:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2232 transitions. [2019-09-09 05:55:05,084 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2232 transitions. Word has length 169 [2019-09-09 05:55:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:05,084 INFO L475 AbstractCegarLoop]: Abstraction has 1522 states and 2232 transitions. [2019-09-09 05:55:05,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2232 transitions. [2019-09-09 05:55:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:55:05,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:05,086 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:05,086 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1887649026, now seen corresponding path program 1 times [2019-09-09 05:55:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:05,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-09 05:55:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:05,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:55:05,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:05,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:55:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:55:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:55:05,362 INFO L87 Difference]: Start difference. First operand 1522 states and 2232 transitions. Second operand 7 states. [2019-09-09 05:55:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:07,314 INFO L93 Difference]: Finished difference Result 4188 states and 6249 transitions. [2019-09-09 05:55:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:55:07,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-09 05:55:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:07,319 INFO L225 Difference]: With dead ends: 4188 [2019-09-09 05:55:07,319 INFO L226 Difference]: Without dead ends: 4188 [2019-09-09 05:55:07,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:55:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2019-09-09 05:55:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2182. [2019-09-09 05:55:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-09-09 05:55:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3388 transitions. [2019-09-09 05:55:07,342 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3388 transitions. Word has length 170 [2019-09-09 05:55:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:07,343 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3388 transitions. [2019-09-09 05:55:07,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:55:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3388 transitions. [2019-09-09 05:55:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-09 05:55:07,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,345 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,346 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash -561951104, now seen corresponding path program 1 times [2019-09-09 05:55:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:08,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:08,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:08,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-09 05:55:08,011 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], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [534], [537], [553], [558], [561], [569], [574], [576], [579], [587], [590], [594], [615], [649], [651], [663], [666], [667], [679], [687], [688], [689] [2019-09-09 05:55:08,054 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:08,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:08,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:08,112 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-09 05:55:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,116 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:08,173 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:08,173 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:08,178 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-09 05:55:08,178 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:08,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:08,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-09 05:55:08,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:08,181 INFO L87 Difference]: Start difference. First operand 2182 states and 3388 transitions. Second operand 2 states. [2019-09-09 05:55:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,181 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:08,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 170 [2019-09-09 05:55:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,182 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:08,182 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:08,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-09 05:55:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:08,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2019-09-09 05:55:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,183 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:08,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:08,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:08,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:08 BoogieIcfgContainer [2019-09-09 05:55:08,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:08,191 INFO L168 Benchmark]: Toolchain (without parser) took 36455.47 ms. Allocated memory was 132.1 MB in the beginning and 638.6 MB in the end (delta: 506.5 MB). Free memory was 85.6 MB in the beginning and 119.9 MB in the end (delta: -34.2 MB). Peak memory consumption was 472.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:08,192 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 132.1 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:55:08,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 920.84 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.6 MB in the beginning and 154.6 MB in the end (delta: -68.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:08,193 INFO L168 Benchmark]: Boogie Preprocessor took 198.74 ms. Allocated memory is still 199.8 MB. Free memory was 154.6 MB in the beginning and 146.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:08,194 INFO L168 Benchmark]: RCFGBuilder took 1371.63 ms. Allocated memory was 199.8 MB in the beginning and 222.8 MB in the end (delta: 23.1 MB). Free memory was 146.9 MB in the beginning and 165.0 MB in the end (delta: -18.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:08,195 INFO L168 Benchmark]: TraceAbstraction took 33959.70 ms. Allocated memory was 222.8 MB in the beginning and 638.6 MB in the end (delta: 415.8 MB). Free memory was 165.0 MB in the beginning and 119.9 MB in the end (delta: 45.1 MB). Peak memory consumption was 460.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:08,198 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.18 ms. Allocated memory is still 132.1 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 920.84 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.6 MB in the beginning and 154.6 MB in the end (delta: -68.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.74 ms. Allocated memory is still 199.8 MB. Free memory was 154.6 MB in the beginning and 146.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1371.63 ms. Allocated memory was 199.8 MB in the beginning and 222.8 MB in the end (delta: 23.1 MB). Free memory was 146.9 MB in the beginning and 165.0 MB in the end (delta: -18.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33959.70 ms. Allocated memory was 222.8 MB in the beginning and 638.6 MB in the end (delta: 415.8 MB). Free memory was 165.0 MB in the beginning and 119.9 MB in the end (delta: 45.1 MB). Peak memory consumption was 460.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1727]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 186 locations, 1 error locations. SAFE Result, 33.8s OverallTime, 69 OverallIterations, 6 TraceHistogramMax, 25.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15785 SDtfs, 5444 SDslu, 22603 SDs, 0 SdLazy, 14010 SolverSat, 652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 313 SyntacticMatches, 35 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2182occurred in iteration=68, 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.2603550295857988 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 69 MinimizatonAttempts, 8767 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 7516 NumberOfCodeBlocks, 7516 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7447 ConstructedInterpolants, 0 QuantifiedInterpolants, 2999485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 68 PerfectInterpolantSequences, 6233/6407 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...