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-efa34d5 [2019-09-16 17:05:54,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:05:54,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:05:54,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:05:54,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:05:54,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:05:54,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:05:54,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:05:54,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:05:54,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:05:54,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:05:54,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:05:54,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:05:54,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:05:54,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:05:54,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:05:54,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:05:54,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:05:54,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:05:54,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:05:54,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:05:54,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:05:54,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:05:54,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:05:54,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:05:54,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:05:54,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:05:54,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:05:54,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:05:54,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:05:54,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:05:54,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:05:54,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:05:54,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:05:54,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:05:54,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:05:54,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:05:54,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:05:54,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:05:54,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:05:54,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:05:54,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:05:54,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:05:54,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:05:54,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:05:54,863 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:05:54,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:05:54,864 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:05:54,864 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:05:54,864 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:05:54,864 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:05:54,865 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:05:54,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:05:54,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:05:54,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:05:54,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:05:54,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:05:54,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:05:54,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:05:54,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:05:54,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:05:54,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:05:54,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:05:54,868 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:05:54,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:05:54,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:54,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:05:54,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:05:54,869 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:05:54,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:05:54,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:05:54,870 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:05:54,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:05:54,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:05:54,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:05:54,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:05:54,923 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:05:54,924 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-16 17:05:55,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d62e660/303fe4b10a01417eb46b1fa43c174b59/FLAG69b9e3bc0 [2019-09-16 17:05:55,605 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:05:55,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.13.i.cil-2.c [2019-09-16 17:05:55,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d62e660/303fe4b10a01417eb46b1fa43c174b59/FLAG69b9e3bc0 [2019-09-16 17:05:55,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d62e660/303fe4b10a01417eb46b1fa43c174b59 [2019-09-16 17:05:55,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:05:55,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:05:55,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:55,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:05:55,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:05:55,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:55" (1/1) ... [2019-09-16 17:05:55,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20abbe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:55, skipping insertion in model container [2019-09-16 17:05:55,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:05:55" (1/1) ... [2019-09-16 17:05:55,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:05:55,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:05:56,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:56,614 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:05:56,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:05:56,884 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:05:56,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56 WrapperNode [2019-09-16 17:05:56,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:05:56,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:05:56,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:05:56,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:05:56,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:56,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:56,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:56,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:57,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:57,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:57,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... [2019-09-16 17:05:57,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:57,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:57,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:57,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:57,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:05:57,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:05:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:05:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:05:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:57,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:05:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:05:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:05:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:57,616 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:58,368 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:05:58,368 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:05:58,392 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:58,393 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:58,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:58 BoogieIcfgContainer [2019-09-16 17:05:58,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:58,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:58,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:58,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:58,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:05:55" (1/3) ... [2019-09-16 17:05:58,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a887b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:58, skipping insertion in model container [2019-09-16 17:05:58,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:05:56" (2/3) ... [2019-09-16 17:05:58,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a887b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:58, skipping insertion in model container [2019-09-16 17:05:58,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:58" (3/3) ... [2019-09-16 17:05:58,406 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-09-16 17:05:58,417 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:58,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:58,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:58,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:58,485 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:58,485 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:58,485 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:58,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:58,485 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:58,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:58,485 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-16 17:05:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 17:05:58,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:58,522 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:58,525 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1489368308, now seen corresponding path program 1 times [2019-09-16 17:05:58,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:58,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:58,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:59,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,071 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-16 17:05:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:59,581 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-16 17:05:59,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:59,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-16 17:05:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:59,607 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:05:59,609 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:05:59,613 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:05:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:05:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:05:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-16 17:05:59,673 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-16 17:05:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:59,673 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-16 17:05:59,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-16 17:05:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-16 17:05:59,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:59,680 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:59,681 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 380678987, now seen corresponding path program 1 times [2019-09-16 17:05:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:59,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:59,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:59,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:59,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:59,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:59,875 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-16 17:06:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,308 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-16 17:06:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-16 17:06:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,312 INFO L225 Difference]: With dead ends: 169 [2019-09-16 17:06:00,312 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 17:06:00,313 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 17:06:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-16 17:06:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:06:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-16 17:06:00,336 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-16 17:06:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,336 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-16 17:06:00,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-16 17:06:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:06:00,340 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,340 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,341 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1401722649, now seen corresponding path program 1 times [2019-09-16 17:06:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:00,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:00,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:00,452 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-16 17:06:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:00,846 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-16 17:06:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:00,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:06:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:00,849 INFO L225 Difference]: With dead ends: 168 [2019-09-16 17:06:00,849 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 17:06:00,850 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 17:06:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-16 17:06:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:06:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-16 17:06:00,860 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-16 17:06:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:00,860 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-16 17:06:00,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-16 17:06:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:06:00,862 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:00,862 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:00,863 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash -536143493, now seen corresponding path program 1 times [2019-09-16 17:06:00,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:00,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:00,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:00,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:00,990 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-16 17:06:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:01,608 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-16 17:06:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:06:01,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-16 17:06:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:01,610 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:06:01,610 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:06:01,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:06:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-16 17:06:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-16 17:06:01,620 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-16 17:06:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:01,621 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-16 17:06:01,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-16 17:06:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:06:01,622 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:01,623 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:01,623 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -358032589, now seen corresponding path program 1 times [2019-09-16 17:06:01,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:01,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:01,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:01,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:01,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:01,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:01,740 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-16 17:06:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,077 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-16 17:06:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:06:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,080 INFO L225 Difference]: With dead ends: 187 [2019-09-16 17:06:02,080 INFO L226 Difference]: Without dead ends: 187 [2019-09-16 17:06:02,080 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-16 17:06:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-16 17:06:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-16 17:06:02,089 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-16 17:06:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,089 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-16 17:06:02,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-16 17:06:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-16 17:06:02,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,091 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,091 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1285498866, now seen corresponding path program 1 times [2019-09-16 17:06:02,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,191 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-16 17:06:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,511 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-16 17:06:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-16 17:06:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,513 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:06:02,513 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:06:02,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:06:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:06:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-16 17:06:02,522 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-16 17:06:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,522 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-16 17:06:02,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-16 17:06:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:06:02,524 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,524 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,524 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1797335240, now seen corresponding path program 1 times [2019-09-16 17:06:02,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:02,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:02,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:02,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:02,603 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-16 17:06:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:02,903 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-16 17:06:02,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:02,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-16 17:06:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:02,906 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:06:02,906 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:06:02,907 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:06:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:06:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-16 17:06:02,913 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-16 17:06:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:02,913 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-16 17:06:02,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-16 17:06:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-16 17:06:02,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:02,915 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:02,915 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1679814895, now seen corresponding path program 1 times [2019-09-16 17:06:02,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:02,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,015 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-16 17:06:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,362 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-16 17:06:03,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-16 17:06:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,364 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:06:03,364 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:06:03,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:06:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:06:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-16 17:06:03,370 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-16 17:06:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,371 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-16 17:06:03,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-16 17:06:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:06:03,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,372 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:03,372 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1049616899, now seen corresponding path program 1 times [2019-09-16 17:06:03,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:03,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,456 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-16 17:06:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:03,761 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-16 17:06:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:03,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:06:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:03,764 INFO L225 Difference]: With dead ends: 185 [2019-09-16 17:06:03,764 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 17:06:03,765 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 17:06:03,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-16 17:06:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:06:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-16 17:06:03,771 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-16 17:06:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:03,771 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-16 17:06:03,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-16 17:06:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:06:03,772 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:03,773 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:03,773 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1277180062, now seen corresponding path program 1 times [2019-09-16 17:06:03,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:03,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:03,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:03,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:03,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:03,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:03,844 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-16 17:06:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,222 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-16 17:06:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-16 17:06:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,224 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:04,224 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:04,225 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:06:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-16 17:06:04,232 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-16 17:06:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,233 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-16 17:06:04,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-16 17:06:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-16 17:06:04,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,234 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,234 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1706280906, now seen corresponding path program 1 times [2019-09-16 17:06:04,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:04,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,301 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-16 17:06:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:04,572 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-16 17:06:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:04,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-16 17:06:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:04,575 INFO L225 Difference]: With dead ends: 197 [2019-09-16 17:06:04,575 INFO L226 Difference]: Without dead ends: 197 [2019-09-16 17:06:04,576 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-16 17:06:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-16 17:06:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-16 17:06:04,582 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-16 17:06:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:04,582 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-16 17:06:04,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-16 17:06:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-16 17:06:04,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:04,583 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:04,584 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1052652213, now seen corresponding path program 1 times [2019-09-16 17:06:04,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:04,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:04,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:04,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:04,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:04,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:04,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:04,652 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-16 17:06:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,002 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:06:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-16 17:06:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,004 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:05,005 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:05,005 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-16 17:06:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-16 17:06:05,013 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-16 17:06:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,014 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-16 17:06:05,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-16 17:06:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:06:05,015 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,016 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,016 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1001699063, now seen corresponding path program 1 times [2019-09-16 17:06:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:05,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,111 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-16 17:06:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,435 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-16 17:06:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:06:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,438 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:06:05,438 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:06:05,438 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:06:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-16 17:06:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-16 17:06:05,445 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-16 17:06:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,446 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-16 17:06:05,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-16 17:06:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:06:05,447 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,447 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,448 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash 641832392, now seen corresponding path program 1 times [2019-09-16 17:06:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:05,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,502 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-16 17:06:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:05,826 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-16 17:06:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:05,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-16 17:06:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:05,828 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:06:05,828 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:06:05,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:06:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:06:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-16 17:06:05,839 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-16 17:06:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:05,840 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-16 17:06:05,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-16 17:06:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 17:06:05,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:05,841 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:05,842 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash -976456270, now seen corresponding path program 1 times [2019-09-16 17:06:05,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:05,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:05,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:05,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:05,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:05,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:05,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:05,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:05,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:05,940 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-16 17:06:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,231 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-16 17:06:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-16 17:06:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,233 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:06:06,233 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:06:06,233 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:06:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:06:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-16 17:06:06,239 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-16 17:06:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,239 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-16 17:06:06,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-16 17:06:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-16 17:06:06,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,240 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:06,241 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1591624005, now seen corresponding path program 1 times [2019-09-16 17:06:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:06,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,303 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-16 17:06:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:06,610 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-16 17:06:06,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:06,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-16 17:06:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:06,613 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:06:06,614 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:06:06,614 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:06:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:06:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-16 17:06:06,621 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-16 17:06:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:06,621 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-16 17:06:06,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-16 17:06:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-16 17:06:06,622 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:06,622 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:06,623 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1684300691, now seen corresponding path program 1 times [2019-09-16 17:06:06,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:06,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:06,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:06,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:06,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:06,703 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-16 17:06:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:07,034 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-16 17:06:07,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:07,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-16 17:06:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:07,036 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:06:07,036 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:06:07,037 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:06:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-16 17:06:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-16 17:06:07,043 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-16 17:06:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:07,043 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-16 17:06:07,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-16 17:06:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 17:06:07,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,044 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:07,045 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785760, now seen corresponding path program 1 times [2019-09-16 17:06:07,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:07,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,111 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-16 17:06:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:07,439 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-16 17:06:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:07,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-16 17:06:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:07,442 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:06:07,442 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:06:07,442 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:06:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-16 17:06:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 17:06:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-16 17:06:07,448 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-16 17:06:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:07,449 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-16 17:06:07,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-16 17:06:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:07,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,450 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:07,450 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,451 INFO L82 PathProgramCache]: Analyzing trace with hash 164825720, now seen corresponding path program 1 times [2019-09-16 17:06:07,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:07,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:07,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:07,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:07,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:07,546 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-16 17:06:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,063 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-16 17:06:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,066 INFO L225 Difference]: With dead ends: 300 [2019-09-16 17:06:08,066 INFO L226 Difference]: Without dead ends: 300 [2019-09-16 17:06:08,066 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-16 17:06:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-16 17:06:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-16 17:06:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-16 17:06:08,077 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-16 17:06:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,078 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-16 17:06:08,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-16 17:06:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:08,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,080 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:08,080 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash 92439162, now seen corresponding path program 1 times [2019-09-16 17:06:08,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:08,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,218 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-16 17:06:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,616 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-16 17:06:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,619 INFO L225 Difference]: With dead ends: 273 [2019-09-16 17:06:08,619 INFO L226 Difference]: Without dead ends: 273 [2019-09-16 17:06:08,620 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-16 17:06:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-16 17:06:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 17:06:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-16 17:06:08,631 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-16 17:06:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,632 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-16 17:06:08,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-16 17:06:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:06:08,634 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,635 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:08,635 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1395813593, now seen corresponding path program 1 times [2019-09-16 17:06:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,773 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-16 17:06:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,240 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-16 17:06:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:06:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,242 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:06:09,242 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:06:09,243 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:06:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-16 17:06:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-16 17:06:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-16 17:06:09,251 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-16 17:06:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,251 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-16 17:06:09,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-16 17:06:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-16 17:06:09,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,253 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:09,253 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1346211210, now seen corresponding path program 1 times [2019-09-16 17:06:09,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:09,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,331 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-16 17:06:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,761 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-16 17:06:09,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-16 17:06:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,764 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:06:09,764 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:06:09,764 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:06:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-16 17:06:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-16 17:06:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-16 17:06:09,771 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-16 17:06:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,772 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-16 17:06:09,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-16 17:06:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-16 17:06:09,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,773 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:09,774 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1209790738, now seen corresponding path program 1 times [2019-09-16 17:06:09,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:09,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,851 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-16 17:06:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,399 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-16 17:06:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-16 17:06:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,403 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:06:10,403 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:06:10,404 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:06:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-16 17:06:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-16 17:06:10,414 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-16 17:06:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,415 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-16 17:06:10,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-16 17:06:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:06:10,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,417 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:10,418 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash -528538785, now seen corresponding path program 1 times [2019-09-16 17:06:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:10,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,514 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-16 17:06:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,109 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-16 17:06:11,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:06:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,111 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:06:11,112 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:06:11,112 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:06:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-16 17:06:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-16 17:06:11,118 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-16 17:06:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,118 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-16 17:06:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-16 17:06:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-16 17:06:11,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,120 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:11,120 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1399733917, now seen corresponding path program 1 times [2019-09-16 17:06:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:11,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,185 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-16 17:06:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,608 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-16 17:06:11,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-16 17:06:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,610 INFO L225 Difference]: With dead ends: 285 [2019-09-16 17:06:11,611 INFO L226 Difference]: Without dead ends: 285 [2019-09-16 17:06:11,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-16 17:06:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-16 17:06:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-16 17:06:11,617 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-16 17:06:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,618 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-16 17:06:11,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-16 17:06:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:06:11,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,619 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:11,620 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1520987551, now seen corresponding path program 1 times [2019-09-16 17:06:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,714 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-16 17:06:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,111 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-16 17:06:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,115 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:06:12,115 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:06:12,115 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:06:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-16 17:06:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-16 17:06:12,122 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-16 17:06:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,122 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-16 17:06:12,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-16 17:06:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:06:12,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,124 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:12,124 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1130448290, now seen corresponding path program 1 times [2019-09-16 17:06:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,190 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-16 17:06:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,595 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-16 17:06:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,597 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:06:12,597 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:06:12,598 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:06:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:06:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-16 17:06:12,604 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-16 17:06:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,604 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-16 17:06:12,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-16 17:06:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:06:12,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,606 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:12,606 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1167899169, now seen corresponding path program 1 times [2019-09-16 17:06:12,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:12,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,676 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-16 17:06:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,004 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-16 17:06:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,008 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:13,008 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:13,009 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-16 17:06:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-16 17:06:13,014 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-16 17:06:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,014 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-16 17:06:13,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-16 17:06:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-16 17:06:13,016 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,016 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,016 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1483536672, now seen corresponding path program 1 times [2019-09-16 17:06:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:13,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,117 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-16 17:06:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,454 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-16 17:06:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-16 17:06:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,457 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:13,457 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:13,457 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-16 17:06:13,466 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-16 17:06:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,466 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-16 17:06:13,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-16 17:06:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:06:13,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,468 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,468 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -82582564, now seen corresponding path program 1 times [2019-09-16 17:06:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:13,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,525 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-16 17:06:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,929 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-16 17:06:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:06:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,932 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:06:13,932 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:06:13,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:06:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:06:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-16 17:06:13,940 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-16 17:06:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,940 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-16 17:06:13,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-16 17:06:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-16 17:06:13,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,942 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,942 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579482, now seen corresponding path program 1 times [2019-09-16 17:06:13,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,004 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-16 17:06:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,299 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-16 17:06:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-16 17:06:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,301 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:14,301 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:14,302 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-16 17:06:14,308 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-16 17:06:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,308 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-16 17:06:14,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-16 17:06:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:06:14,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,310 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:14,310 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -763062181, now seen corresponding path program 1 times [2019-09-16 17:06:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:14,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,389 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-16 17:06:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,790 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-16 17:06:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:06:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,793 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:06:14,793 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:06:14,794 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:06:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:06:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-16 17:06:14,803 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-16 17:06:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,804 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-16 17:06:14,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-16 17:06:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:06:14,805 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,805 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:14,805 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -778580899, now seen corresponding path program 1 times [2019-09-16 17:06:14,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:14,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,869 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-16 17:06:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,192 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-16 17:06:15,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-16 17:06:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,195 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:15,196 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:15,196 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-16 17:06:15,202 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-16 17:06:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,202 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-16 17:06:15,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-16 17:06:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:06:15,203 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,204 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:15,204 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1665128425, now seen corresponding path program 1 times [2019-09-16 17:06:15,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:15,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,272 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-16 17:06:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,668 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-16 17:06:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:06:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,671 INFO L225 Difference]: With dead ends: 307 [2019-09-16 17:06:15,671 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 17:06:15,672 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 17:06:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-16 17:06:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-16 17:06:15,678 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-16 17:06:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,678 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-16 17:06:15,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-16 17:06:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-16 17:06:15,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,679 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:15,680 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2146208683, now seen corresponding path program 1 times [2019-09-16 17:06:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:15,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,752 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-16 17:06:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,091 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-16 17:06:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-16 17:06:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,094 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:06:16,095 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:06:16,095 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:06:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-16 17:06:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-16 17:06:16,100 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-16 17:06:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,100 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-16 17:06:16,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-16 17:06:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:06:16,101 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,101 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:16,102 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash -846445514, now seen corresponding path program 1 times [2019-09-16 17:06:16,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:16,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,189 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-16 17:06:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,572 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-16 17:06:16,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:06:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,573 INFO L225 Difference]: With dead ends: 297 [2019-09-16 17:06:16,574 INFO L226 Difference]: Without dead ends: 297 [2019-09-16 17:06:16,574 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-16 17:06:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-16 17:06:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-16 17:06:16,580 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-16 17:06:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,581 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-16 17:06:16,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-16 17:06:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:06:16,582 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,582 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:16,582 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1419935672, now seen corresponding path program 1 times [2019-09-16 17:06:16,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:16,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,652 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-16 17:06:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,923 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-16 17:06:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-16 17:06:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,925 INFO L225 Difference]: With dead ends: 272 [2019-09-16 17:06:16,925 INFO L226 Difference]: Without dead ends: 272 [2019-09-16 17:06:16,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-16 17:06:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-16 17:06:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-16 17:06:16,931 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-16 17:06:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,931 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-16 17:06:16,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-16 17:06:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:16,932 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,933 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:16,933 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 228784092, now seen corresponding path program 1 times [2019-09-16 17:06:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:17,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,005 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-16 17:06:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,380 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-16 17:06:17,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,383 INFO L225 Difference]: With dead ends: 297 [2019-09-16 17:06:17,384 INFO L226 Difference]: Without dead ends: 297 [2019-09-16 17:06:17,384 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-16 17:06:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-16 17:06:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:06:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-16 17:06:17,390 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-16 17:06:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,390 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-16 17:06:17,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-16 17:06:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:17,392 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,392 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,392 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1615569502, now seen corresponding path program 1 times [2019-09-16 17:06:17,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 17:06:17,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:17,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,479 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-16 17:06:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,520 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-16 17:06:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:17,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-16 17:06:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,523 INFO L225 Difference]: With dead ends: 493 [2019-09-16 17:06:17,523 INFO L226 Difference]: Without dead ends: 493 [2019-09-16 17:06:17,523 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-16 17:06:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-16 17:06:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-16 17:06:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-16 17:06:17,532 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-16 17:06:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,532 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-16 17:06:17,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-16 17:06:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:17,534 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,534 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,534 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash -929123768, now seen corresponding path program 1 times [2019-09-16 17:06:17,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:17,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:17,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,604 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-16 17:06:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,660 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-16 17:06:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:17,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:06:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,664 INFO L225 Difference]: With dead ends: 728 [2019-09-16 17:06:17,664 INFO L226 Difference]: Without dead ends: 728 [2019-09-16 17:06:17,665 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-16 17:06:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-16 17:06:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-16 17:06:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-16 17:06:17,676 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-16 17:06:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,676 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-16 17:06:17,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-16 17:06:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:06:17,678 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,678 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,679 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 369425990, now seen corresponding path program 1 times [2019-09-16 17:06:17,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:17,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,738 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-16 17:06:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,795 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-16 17:06:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:17,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-16 17:06:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,800 INFO L225 Difference]: With dead ends: 961 [2019-09-16 17:06:17,800 INFO L226 Difference]: Without dead ends: 961 [2019-09-16 17:06:17,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-16 17:06:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-16 17:06:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-16 17:06:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-16 17:06:17,814 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-16 17:06:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,815 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-16 17:06:17,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-16 17:06:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:06:17,817 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,817 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,818 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2133236826, now seen corresponding path program 1 times [2019-09-16 17:06:17,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:17,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,890 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-16 17:06:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,386 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-16 17:06:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:06:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,393 INFO L225 Difference]: With dead ends: 1369 [2019-09-16 17:06:18,393 INFO L226 Difference]: Without dead ends: 1369 [2019-09-16 17:06:18,393 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-16 17:06:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-16 17:06:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-16 17:06:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-16 17:06:18,412 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-16 17:06:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,412 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-16 17:06:18,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-16 17:06:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:06:18,415 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,415 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:18,415 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1698497454, now seen corresponding path program 1 times [2019-09-16 17:06:18,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:18,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,498 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-16 17:06:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,973 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-16 17:06:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:06:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,978 INFO L225 Difference]: With dead ends: 1351 [2019-09-16 17:06:18,978 INFO L226 Difference]: Without dead ends: 1351 [2019-09-16 17:06:18,978 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-16 17:06:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-16 17:06:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-16 17:06:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-16 17:06:18,997 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-16 17:06:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,997 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-16 17:06:18,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-16 17:06:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:06:19,000 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,000 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,000 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -502838968, now seen corresponding path program 1 times [2019-09-16 17:06:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:19,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:19,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:19,096 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-16 17:06:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,146 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-16 17:06:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:19,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-16 17:06:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,152 INFO L225 Difference]: With dead ends: 1339 [2019-09-16 17:06:19,152 INFO L226 Difference]: Without dead ends: 1339 [2019-09-16 17:06:19,152 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-16 17:06:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-16 17:06:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-16 17:06:19,172 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-16 17:06:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,172 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-16 17:06:19,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-16 17:06:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:06:19,175 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,175 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,176 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 682232505, now seen corresponding path program 1 times [2019-09-16 17:06:19,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,250 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-16 17:06:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,745 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-16 17:06:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:06:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,751 INFO L225 Difference]: With dead ends: 1682 [2019-09-16 17:06:19,751 INFO L226 Difference]: Without dead ends: 1682 [2019-09-16 17:06:19,752 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-16 17:06:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-16 17:06:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-16 17:06:19,770 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-16 17:06:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,770 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-16 17:06:19,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-16 17:06:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:19,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,774 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,774 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1599625407, now seen corresponding path program 1 times [2019-09-16 17:06:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:19,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,840 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-16 17:06:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,319 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-16 17:06:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,326 INFO L225 Difference]: With dead ends: 1677 [2019-09-16 17:06:20,327 INFO L226 Difference]: Without dead ends: 1677 [2019-09-16 17:06:20,327 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-16 17:06:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-16 17:06:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-16 17:06:20,348 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-16 17:06:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,349 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-16 17:06:20,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-16 17:06:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:20,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,352 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,353 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash 58403008, now seen corresponding path program 1 times [2019-09-16 17:06:20,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:20,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,434 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-16 17:06:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,975 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-16 17:06:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,987 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:06:20,987 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:06:20,987 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:06:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:06:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-16 17:06:21,015 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-16 17:06:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,016 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-16 17:06:21,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-16 17:06:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:21,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,020 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,020 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1044774282, now seen corresponding path program 1 times [2019-09-16 17:06:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:21,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,127 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-16 17:06:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,622 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-16 17:06:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,631 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:06:21,631 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:06:21,632 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:06:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:06:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-16 17:06:21,652 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-16 17:06:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,652 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-16 17:06:21,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-16 17:06:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:06:21,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,655 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,655 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1179079683, now seen corresponding path program 1 times [2019-09-16 17:06:21,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:21,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,724 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-16 17:06:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,199 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-16 17:06:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-16 17:06:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,205 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:06:22,205 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:06:22,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:06:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:06:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-16 17:06:22,220 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-16 17:06:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,220 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-16 17:06:22,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-16 17:06:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:06:22,223 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,223 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,223 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1625618289, now seen corresponding path program 1 times [2019-09-16 17:06:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,297 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:06:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,772 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-16 17:06:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:06:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,782 INFO L225 Difference]: With dead ends: 1667 [2019-09-16 17:06:22,782 INFO L226 Difference]: Without dead ends: 1667 [2019-09-16 17:06:22,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-16 17:06:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-16 17:06:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-16 17:06:22,803 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-16 17:06:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,803 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-16 17:06:22,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-16 17:06:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:06:22,806 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,806 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,807 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1050140312, now seen corresponding path program 1 times [2019-09-16 17:06:22,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:22,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,893 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:06:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,369 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-16 17:06:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:06:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,375 INFO L225 Difference]: With dead ends: 1617 [2019-09-16 17:06:23,375 INFO L226 Difference]: Without dead ends: 1617 [2019-09-16 17:06:23,376 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-16 17:06:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-16 17:06:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-16 17:06:23,399 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-16 17:06:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,399 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-16 17:06:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-16 17:06:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:06:23,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,405 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:23,405 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1657295938, now seen corresponding path program 1 times [2019-09-16 17:06:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:23,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,495 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:06:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,043 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-16 17:06:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:06:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,050 INFO L225 Difference]: With dead ends: 1617 [2019-09-16 17:06:24,050 INFO L226 Difference]: Without dead ends: 1617 [2019-09-16 17:06:24,050 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-16 17:06:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-16 17:06:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-16 17:06:24,079 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-16 17:06:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,080 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-16 17:06:24,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-16 17:06:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:06:24,082 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,083 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,083 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,083 INFO L82 PathProgramCache]: Analyzing trace with hash -459540457, now seen corresponding path program 1 times [2019-09-16 17:06:24,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,176 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:06:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,750 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-16 17:06:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:06:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,757 INFO L225 Difference]: With dead ends: 1592 [2019-09-16 17:06:24,757 INFO L226 Difference]: Without dead ends: 1592 [2019-09-16 17:06:24,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-16 17:06:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-16 17:06:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-16 17:06:24,779 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-16 17:06:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,779 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-16 17:06:24,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-16 17:06:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:24,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,782 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,783 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1308556535, now seen corresponding path program 1 times [2019-09-16 17:06:24,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:24,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,881 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,314 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-16 17:06:25,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,319 INFO L225 Difference]: With dead ends: 1592 [2019-09-16 17:06:25,319 INFO L226 Difference]: Without dead ends: 1592 [2019-09-16 17:06:25,320 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-16 17:06:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-16 17:06:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-16 17:06:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-16 17:06:25,337 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-16 17:06:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,338 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-16 17:06:25,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-16 17:06:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:25,340 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,342 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,342 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1355244734, now seen corresponding path program 1 times [2019-09-16 17:06:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:25,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,438 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,869 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-16 17:06:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,873 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:25,874 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:25,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-16 17:06:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-16 17:06:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-16 17:06:25,892 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-16 17:06:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,893 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-16 17:06:25,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-16 17:06:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:25,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,896 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,896 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash -245297578, now seen corresponding path program 1 times [2019-09-16 17:06:25,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,973 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-16 17:06:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,401 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-16 17:06:26,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,408 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:26,408 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:26,409 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-16 17:06:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-16 17:06:26,425 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-16 17:06:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,426 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-16 17:06:26,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-16 17:06:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:26,429 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,429 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,429 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash -304506221, now seen corresponding path program 1 times [2019-09-16 17:06:26,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:26,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,516 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,953 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-16 17:06:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,957 INFO L225 Difference]: With dead ends: 1552 [2019-09-16 17:06:26,957 INFO L226 Difference]: Without dead ends: 1552 [2019-09-16 17:06:26,957 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-16 17:06:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-16 17:06:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-16 17:06:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-16 17:06:26,973 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-16 17:06:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,974 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-16 17:06:26,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-16 17:06:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:26,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,976 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,977 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash -698012739, now seen corresponding path program 1 times [2019-09-16 17:06:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:27,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,070 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,421 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-16 17:06:27,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,425 INFO L225 Difference]: With dead ends: 1542 [2019-09-16 17:06:27,425 INFO L226 Difference]: Without dead ends: 1542 [2019-09-16 17:06:27,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-16 17:06:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-16 17:06:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-16 17:06:27,442 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-16 17:06:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,443 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-16 17:06:27,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-16 17:06:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:27,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,445 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,446 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2086211788, now seen corresponding path program 1 times [2019-09-16 17:06:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:27,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,529 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,919 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-16 17:06:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,925 INFO L225 Difference]: With dead ends: 1532 [2019-09-16 17:06:27,925 INFO L226 Difference]: Without dead ends: 1532 [2019-09-16 17:06:27,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-16 17:06:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-16 17:06:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-16 17:06:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-16 17:06:27,942 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-16 17:06:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,943 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-16 17:06:27,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-16 17:06:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:27,946 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,946 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,946 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -960768076, now seen corresponding path program 1 times [2019-09-16 17:06:27,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:28,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,030 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-16 17:06:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,419 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-16 17:06:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,424 INFO L225 Difference]: With dead ends: 1517 [2019-09-16 17:06:28,424 INFO L226 Difference]: Without dead ends: 1517 [2019-09-16 17:06:28,424 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-16 17:06:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-16 17:06:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 17:06:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-16 17:06:28,444 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-16 17:06:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,445 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-16 17:06:28,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-16 17:06:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:28,447 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,447 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,448 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2014185627, now seen corresponding path program 1 times [2019-09-16 17:06:28,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,566 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-16 17:06:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,929 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-16 17:06:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,933 INFO L225 Difference]: With dead ends: 1517 [2019-09-16 17:06:28,933 INFO L226 Difference]: Without dead ends: 1517 [2019-09-16 17:06:28,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-16 17:06:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-16 17:06:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-16 17:06:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-16 17:06:28,948 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-16 17:06:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,948 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-16 17:06:28,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-16 17:06:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:28,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,951 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,951 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1202525105, now seen corresponding path program 1 times [2019-09-16 17:06:28,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:29,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,048 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-16 17:06:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,400 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-16 17:06:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,403 INFO L225 Difference]: With dead ends: 1497 [2019-09-16 17:06:29,403 INFO L226 Difference]: Without dead ends: 1497 [2019-09-16 17:06:29,403 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-16 17:06:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-16 17:06:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-16 17:06:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-16 17:06:29,420 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-16 17:06:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,421 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-16 17:06:29,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-16 17:06:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:29,423 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,423 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,424 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1712961357, now seen corresponding path program 1 times [2019-09-16 17:06:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:29,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,512 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-16 17:06:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,842 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-16 17:06:29,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,845 INFO L225 Difference]: With dead ends: 1497 [2019-09-16 17:06:29,845 INFO L226 Difference]: Without dead ends: 1497 [2019-09-16 17:06:29,845 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-16 17:06:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-16 17:06:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:06:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-16 17:06:29,860 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-16 17:06:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,861 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-16 17:06:29,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-16 17:06:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:29,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,863 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,864 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1145389383, now seen corresponding path program 1 times [2019-09-16 17:06:29,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:29,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,945 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-16 17:06:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,285 INFO L93 Difference]: Finished difference Result 1487 states and 2130 transitions. [2019-09-16 17:06:30,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,289 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:30,289 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:30,289 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2019-09-16 17:06:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-16 17:06:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-16 17:06:30,305 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-16 17:06:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,305 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-16 17:06:30,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-16 17:06:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:30,308 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,308 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,309 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1245927820, now seen corresponding path program 1 times [2019-09-16 17:06:30,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,395 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-16 17:06:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,738 INFO L93 Difference]: Finished difference Result 1487 states and 2125 transitions. [2019-09-16 17:06:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,741 INFO L225 Difference]: With dead ends: 1487 [2019-09-16 17:06:30,742 INFO L226 Difference]: Without dead ends: 1487 [2019-09-16 17:06:30,742 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-16 17:06:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2019-09-16 17:06:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-16 17:06:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-16 17:06:30,769 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2019-09-16 17:06:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,770 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-16 17:06:30,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-16 17:06:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:30,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,772 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,772 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1883212056, now seen corresponding path program 1 times [2019-09-16 17:06:30,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:30,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,852 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-16 17:06:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,186 INFO L93 Difference]: Finished difference Result 1467 states and 2097 transitions. [2019-09-16 17:06:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,189 INFO L225 Difference]: With dead ends: 1467 [2019-09-16 17:06:31,190 INFO L226 Difference]: Without dead ends: 1467 [2019-09-16 17:06:31,190 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-16 17:06:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2019-09-16 17:06:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-16 17:06:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-16 17:06:31,206 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2019-09-16 17:06:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,207 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-16 17:06:31,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-16 17:06:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:06:31,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,210 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,210 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash -648127340, now seen corresponding path program 1 times [2019-09-16 17:06:31,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,299 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 4 states. [2019-09-16 17:06:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,699 INFO L93 Difference]: Finished difference Result 1697 states and 2463 transitions. [2019-09-16 17:06:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-16 17:06:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,702 INFO L225 Difference]: With dead ends: 1697 [2019-09-16 17:06:31,702 INFO L226 Difference]: Without dead ends: 1697 [2019-09-16 17:06:31,702 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-16 17:06:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1522. [2019-09-16 17:06:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-09-16 17:06:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2232 transitions. [2019-09-16 17:06:31,715 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2232 transitions. Word has length 169 [2019-09-16 17:06:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,716 INFO L475 AbstractCegarLoop]: Abstraction has 1522 states and 2232 transitions. [2019-09-16 17:06:31,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2232 transitions. [2019-09-16 17:06:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-16 17:06:31,717 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,718 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,718 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1887649026, now seen corresponding path program 1 times [2019-09-16 17:06:31,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-16 17:06:32,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 17:06:32,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 17:06:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 17:06:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:32,030 INFO L87 Difference]: Start difference. First operand 1522 states and 2232 transitions. Second operand 7 states. [2019-09-16 17:06:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,070 INFO L93 Difference]: Finished difference Result 4188 states and 6249 transitions. [2019-09-16 17:06:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 17:06:34,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-16 17:06:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,074 INFO L225 Difference]: With dead ends: 4188 [2019-09-16 17:06:34,075 INFO L226 Difference]: Without dead ends: 4188 [2019-09-16 17:06:34,075 INFO L636 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-16 17:06:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2019-09-16 17:06:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2182. [2019-09-16 17:06:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-09-16 17:06:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3388 transitions. [2019-09-16 17:06:34,104 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3388 transitions. Word has length 170 [2019-09-16 17:06:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,104 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3388 transitions. [2019-09-16 17:06:34,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 17:06:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3388 transitions. [2019-09-16 17:06:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-16 17:06:34,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,108 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:34,108 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -561951104, now seen corresponding path program 1 times [2019-09-16 17:06:34,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,749 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-16 17:06:34,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:34,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:34,750 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-16 17:06:34,752 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-16 17:06:34,794 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:34,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:34,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:34,852 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:06:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,856 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:34,919 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:34,919 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:34,924 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-16 17:06:34,924 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:34,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:34,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-16 17:06:34,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:34,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:34,927 INFO L87 Difference]: Start difference. First operand 2182 states and 3388 transitions. Second operand 2 states. [2019-09-16 17:06:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,927 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:34,928 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 170 [2019-09-16 17:06:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,928 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:34,928 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:34,928 INFO L636 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-16 17:06:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:34,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2019-09-16 17:06:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,929 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:34,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:34,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:34,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:34 BoogieIcfgContainer [2019-09-16 17:06:34,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:34,937 INFO L168 Benchmark]: Toolchain (without parser) took 39063.28 ms. Allocated memory was 132.1 MB in the beginning and 632.8 MB in the end (delta: 500.7 MB). Free memory was 85.5 MB in the beginning and 319.1 MB in the end (delta: -233.6 MB). Peak memory consumption was 267.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:34,938 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 132.1 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 17:06:34,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1011.73 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 85.1 MB in the beginning and 155.9 MB in the end (delta: -70.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:34,939 INFO L168 Benchmark]: Boogie Preprocessor took 197.22 ms. Allocated memory is still 200.3 MB. Free memory was 155.9 MB in the beginning and 148.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:34,940 INFO L168 Benchmark]: RCFGBuilder took 1311.37 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 148.2 MB in the beginning and 165.0 MB in the end (delta: -16.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:34,940 INFO L168 Benchmark]: TraceAbstraction took 36538.30 ms. Allocated memory was 223.3 MB in the beginning and 632.8 MB in the end (delta: 409.5 MB). Free memory was 165.0 MB in the beginning and 319.1 MB in the end (delta: -154.1 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:34,944 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.27 ms. Allocated memory is still 132.1 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1011.73 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 85.1 MB in the beginning and 155.9 MB in the end (delta: -70.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 197.22 ms. Allocated memory is still 200.3 MB. Free memory was 155.9 MB in the beginning and 148.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1311.37 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 148.2 MB in the beginning and 165.0 MB in the end (delta: -16.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36538.30 ms. Allocated memory was 223.3 MB in the beginning and 632.8 MB in the end (delta: 409.5 MB). Free memory was 165.0 MB in the beginning and 319.1 MB in the end (delta: -154.1 MB). Peak memory consumption was 255.4 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, 36.4s OverallTime, 69 OverallIterations, 6 TraceHistogramMax, 27.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15785 SDtfs, 5444 SDslu, 22603 SDs, 0 SdLazy, 14010 SolverSat, 652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 313 SyntacticMatches, 35 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s 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.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 7516 NumberOfCodeBlocks, 7516 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7447 ConstructedInterpolants, 0 QuantifiedInterpolants, 3008780 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...