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/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:45:50,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:45:50,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:45:51,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:45:51,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:45:51,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:45:51,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:45:51,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:45:51,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:45:51,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:45:51,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:45:51,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:45:51,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:45:51,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:45:51,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:45:51,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:45:51,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:45:51,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:45:51,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:45:51,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:45:51,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:45:51,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:45:51,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:45:51,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:45:51,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:45:51,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:45:51,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:45:51,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:45:51,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:45:51,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:45:51,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:45:51,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:45:51,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:45:51,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:45:51,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:45:51,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:45:51,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:45:51,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:45:51,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:45:51,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:45:51,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:45:51,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:45:51,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:45:51,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:45:51,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:45:51,097 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:45:51,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:45:51,098 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:45:51,098 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:45:51,100 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:45:51,100 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:45:51,101 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:45:51,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:45:51,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:45:51,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:45:51,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:45:51,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:45:51,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:45:51,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:45:51,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:45:51,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:45:51,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:45:51,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:45:51,106 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:45:51,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:45:51,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:51,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:45:51,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:45:51,107 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:45:51,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:45:51,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:45:51,108 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:45:51,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:45:51,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:45:51,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:45:51,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:45:51,184 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:45:51,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-09 05:45:51,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de009171d/61d7ec80b2f843488e59f384fd17419e/FLAGedde2b128 [2019-09-09 05:45:51,685 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:45:51,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-09 05:45:51,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de009171d/61d7ec80b2f843488e59f384fd17419e/FLAGedde2b128 [2019-09-09 05:45:52,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de009171d/61d7ec80b2f843488e59f384fd17419e [2019-09-09 05:45:52,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:45:52,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:45:52,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:52,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:45:52,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:45:52,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b237eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52, skipping insertion in model container [2019-09-09 05:45:52,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,041 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:45:52,110 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:45:52,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:52,666 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:45:52,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:52,781 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:45:52,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52 WrapperNode [2019-09-09 05:45:52,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:52,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:45:52,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:45:52,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:45:52,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... [2019-09-09 05:45:52,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:45:52,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:45:52,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:45:52,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:45:52,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:45:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:45:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:45:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-09 05:45:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-09 05:45:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-09 05:45:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-09 05:45:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-09 05:45:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-09 05:45:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:45:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:45:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:45:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-09 05:45:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:45:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:45:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:45:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-09 05:45:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:45:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:45:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:45:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:45:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:45:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:45:53,284 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,447 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-09 05:45:53,448 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-09 05:45:53,465 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,526 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-09 05:45:53,526 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-09 05:45:53,543 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,564 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:45:53,564 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:45:53,572 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,585 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:45:53,585 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:45:53,807 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,847 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-09 05:45:53,848 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-09 05:45:53,878 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:45:53,899 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-09 05:45:53,900 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-09 05:45:53,927 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:45:53,927 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:45:53,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:53 BoogieIcfgContainer [2019-09-09 05:45:53,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:45:53,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:45:53,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:45:53,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:45:53,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:45:52" (1/3) ... [2019-09-09 05:45:53,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d7507f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:53, skipping insertion in model container [2019-09-09 05:45:53,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:52" (2/3) ... [2019-09-09 05:45:53,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d7507f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:53, skipping insertion in model container [2019-09-09 05:45:53,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:53" (3/3) ... [2019-09-09 05:45:53,937 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-09-09 05:45:53,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:45:53,954 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:45:53,970 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:45:54,014 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:45:54,015 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:45:54,015 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:45:54,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:45:54,015 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:45:54,015 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:45:54,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:45:54,016 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:45:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-09-09 05:45:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:45:54,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:54,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:54,051 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-09-09 05:45:54,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:54,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:54,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:54,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:54,326 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-09-09 05:45:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:54,516 INFO L93 Difference]: Finished difference Result 303 states and 411 transitions. [2019-09-09 05:45:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:54,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:45:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:54,532 INFO L225 Difference]: With dead ends: 303 [2019-09-09 05:45:54,532 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:45:54,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:45:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-09-09 05:45:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-09 05:45:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-09-09 05:45:54,603 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-09-09 05:45:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:54,604 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-09-09 05:45:54,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-09-09 05:45:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:45:54,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:54,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:54,606 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-09-09 05:45:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:54,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:54,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:54,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:54,788 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-09-09 05:45:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:54,990 INFO L93 Difference]: Finished difference Result 455 states and 623 transitions. [2019-09-09 05:45:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:54,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:45:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:54,998 INFO L225 Difference]: With dead ends: 455 [2019-09-09 05:45:54,999 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:45:55,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:45:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-09-09 05:45:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-09 05:45:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-09-09 05:45:55,078 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-09-09 05:45:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:55,079 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-09-09 05:45:55,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-09-09 05:45:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:45:55,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:55,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:55,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-09-09 05:45:55,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:55,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:55,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:55,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,211 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-09-09 05:45:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:55,257 INFO L93 Difference]: Finished difference Result 646 states and 914 transitions. [2019-09-09 05:45:55,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:55,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:45:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:55,265 INFO L225 Difference]: With dead ends: 646 [2019-09-09 05:45:55,266 INFO L226 Difference]: Without dead ends: 646 [2019-09-09 05:45:55,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-09 05:45:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-09-09 05:45:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-09 05:45:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-09-09 05:45:55,306 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-09-09 05:45:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:55,306 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-09-09 05:45:55,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-09-09 05:45:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:45:55,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:55,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:55,309 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-09-09 05:45:55,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:55,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:55,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,400 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-09-09 05:45:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:55,489 INFO L93 Difference]: Finished difference Result 617 states and 882 transitions. [2019-09-09 05:45:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:55,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-09 05:45:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:55,496 INFO L225 Difference]: With dead ends: 617 [2019-09-09 05:45:55,496 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:45:55,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:45:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-09 05:45:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-09 05:45:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-09-09 05:45:55,564 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-09-09 05:45:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:55,564 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-09-09 05:45:55,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-09-09 05:45:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-09 05:45:55,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:55,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:55,567 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-09-09 05:45:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:55,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:55,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:55,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:55,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:55,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:55,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,613 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-09-09 05:45:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:55,662 INFO L93 Difference]: Finished difference Result 1053 states and 1556 transitions. [2019-09-09 05:45:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:55,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-09 05:45:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:55,670 INFO L225 Difference]: With dead ends: 1053 [2019-09-09 05:45:55,671 INFO L226 Difference]: Without dead ends: 1053 [2019-09-09 05:45:55,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-09 05:45:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-09-09 05:45:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-09-09 05:45:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-09-09 05:45:55,717 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-09-09 05:45:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:55,718 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-09-09 05:45:55,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-09-09 05:45:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-09 05:45:55,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:55,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:55,720 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-09-09 05:45:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:55,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:55,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:55,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:55,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:55,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,768 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-09-09 05:45:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:55,849 INFO L93 Difference]: Finished difference Result 1045 states and 1547 transitions. [2019-09-09 05:45:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:55,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-09 05:45:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:55,858 INFO L225 Difference]: With dead ends: 1045 [2019-09-09 05:45:55,858 INFO L226 Difference]: Without dead ends: 1045 [2019-09-09 05:45:55,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-09 05:45:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-09-09 05:45:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-09 05:45:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-09-09 05:45:55,899 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-09-09 05:45:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-09-09 05:45:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-09-09 05:45:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:45:55,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:55,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:55,902 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-09-09 05:45:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:55,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:55,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:55,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:55,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:45:55,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:55,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:55,966 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-09-09 05:45:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:56,008 INFO L93 Difference]: Finished difference Result 1055 states and 1561 transitions. [2019-09-09 05:45:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:56,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-09 05:45:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:56,016 INFO L225 Difference]: With dead ends: 1055 [2019-09-09 05:45:56,017 INFO L226 Difference]: Without dead ends: 1036 [2019-09-09 05:45:56,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-09 05:45:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-09-09 05:45:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-09 05:45:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-09-09 05:45:56,063 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-09-09 05:45:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:56,063 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-09-09 05:45:56,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-09-09 05:45:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:45:56,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:56,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:56,065 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-09-09 05:45:56,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:56,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:56,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:56,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:56,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:56,121 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-09-09 05:45:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:56,137 INFO L93 Difference]: Finished difference Result 578 states and 823 transitions. [2019-09-09 05:45:56,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:56,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-09 05:45:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:56,143 INFO L225 Difference]: With dead ends: 578 [2019-09-09 05:45:56,143 INFO L226 Difference]: Without dead ends: 578 [2019-09-09 05:45:56,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-09 05:45:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-09 05:45:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-09 05:45:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-09-09 05:45:56,170 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-09-09 05:45:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:56,171 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-09-09 05:45:56,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-09-09 05:45:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 05:45:56,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:56,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:56,173 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-09-09 05:45:56,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:45:56,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:56,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:56,235 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2019-09-09 05:45:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:56,648 INFO L93 Difference]: Finished difference Result 580 states and 823 transitions. [2019-09-09 05:45:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:56,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-09 05:45:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:56,654 INFO L225 Difference]: With dead ends: 580 [2019-09-09 05:45:56,654 INFO L226 Difference]: Without dead ends: 580 [2019-09-09 05:45:56,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-09 05:45:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2019-09-09 05:45:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-09 05:45:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-09-09 05:45:56,677 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-09-09 05:45:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:56,677 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-09-09 05:45:56,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-09-09 05:45:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:45:56,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:56,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:56,680 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-09-09 05:45:56,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:56,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:56,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:56,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:45:56,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:56,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:56,744 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2019-09-09 05:45:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:57,075 INFO L93 Difference]: Finished difference Result 580 states and 822 transitions. [2019-09-09 05:45:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:57,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-09 05:45:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:57,082 INFO L225 Difference]: With dead ends: 580 [2019-09-09 05:45:57,082 INFO L226 Difference]: Without dead ends: 580 [2019-09-09 05:45:57,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-09 05:45:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2019-09-09 05:45:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-09 05:45:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-09-09 05:45:57,100 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-09-09 05:45:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:57,101 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-09-09 05:45:57,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-09-09 05:45:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:45:57,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:57,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:57,102 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-09-09 05:45:57,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:57,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:57,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:45:57,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:57,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:57,206 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-09-09 05:45:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:57,256 INFO L93 Difference]: Finished difference Result 598 states and 843 transitions. [2019-09-09 05:45:57,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:45:57,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-09 05:45:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:57,260 INFO L225 Difference]: With dead ends: 598 [2019-09-09 05:45:57,261 INFO L226 Difference]: Without dead ends: 576 [2019-09-09 05:45:57,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:45:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-09 05:45:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-09 05:45:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-09 05:45:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-09-09 05:45:57,279 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-09-09 05:45:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:57,279 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-09-09 05:45:57,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-09-09 05:45:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:45:57,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:57,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:57,281 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-09-09 05:45:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:57,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:57,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:57,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:57,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:57,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:57,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:57,322 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-09-09 05:45:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:57,451 INFO L93 Difference]: Finished difference Result 802 states and 1192 transitions. [2019-09-09 05:45:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:57,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-09 05:45:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:57,459 INFO L225 Difference]: With dead ends: 802 [2019-09-09 05:45:57,459 INFO L226 Difference]: Without dead ends: 802 [2019-09-09 05:45:57,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-09 05:45:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-09-09 05:45:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-09 05:45:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-09-09 05:45:57,494 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-09-09 05:45:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:57,494 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-09-09 05:45:57,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-09-09 05:45:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:57,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:57,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:57,496 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1266981467, now seen corresponding path program 1 times [2019-09-09 05:45:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:57,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:57,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:45:57,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:57,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:57,569 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-09-09 05:45:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:57,741 INFO L93 Difference]: Finished difference Result 452 states and 584 transitions. [2019-09-09 05:45:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:45:57,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-09 05:45:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:57,744 INFO L225 Difference]: With dead ends: 452 [2019-09-09 05:45:57,745 INFO L226 Difference]: Without dead ends: 452 [2019-09-09 05:45:57,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-09 05:45:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-09-09 05:45:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-09 05:45:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-09-09 05:45:57,757 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 50 [2019-09-09 05:45:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:57,758 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-09-09 05:45:57,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-09-09 05:45:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:45:57,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:57,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:57,760 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-09-09 05:45:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:57,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:57,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:57,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:45:57,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:57,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:57,861 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-09-09 05:45:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:58,103 INFO L93 Difference]: Finished difference Result 444 states and 579 transitions. [2019-09-09 05:45:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:58,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-09 05:45:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:58,108 INFO L225 Difference]: With dead ends: 444 [2019-09-09 05:45:58,109 INFO L226 Difference]: Without dead ends: 443 [2019-09-09 05:45:58,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:45:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-09 05:45:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-09 05:45:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-09 05:45:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-09-09 05:45:58,127 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-09-09 05:45:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:58,127 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-09-09 05:45:58,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-09-09 05:45:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:45:58,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:58,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:58,129 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-09-09 05:45:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:58,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:58,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:58,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:45:58,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:58,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:58,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:58,262 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-09-09 05:45:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:58,358 INFO L93 Difference]: Finished difference Result 477 states and 637 transitions. [2019-09-09 05:45:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:58,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-09 05:45:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:58,363 INFO L225 Difference]: With dead ends: 477 [2019-09-09 05:45:58,364 INFO L226 Difference]: Without dead ends: 462 [2019-09-09 05:45:58,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:45:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-09 05:45:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-09-09 05:45:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-09 05:45:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-09 05:45:58,385 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-09-09 05:45:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:58,385 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-09 05:45:58,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-09 05:45:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:58,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:58,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:58,388 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:58,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-09-09 05:45:58,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:58,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:58,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:58,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:58,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:45:58,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:58,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:58,466 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-09-09 05:45:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:59,034 INFO L93 Difference]: Finished difference Result 578 states and 791 transitions. [2019-09-09 05:45:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:59,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-09 05:45:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:59,038 INFO L225 Difference]: With dead ends: 578 [2019-09-09 05:45:59,038 INFO L226 Difference]: Without dead ends: 578 [2019-09-09 05:45:59,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-09 05:45:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 449. [2019-09-09 05:45:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-09 05:45:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 587 transitions. [2019-09-09 05:45:59,052 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 587 transitions. Word has length 48 [2019-09-09 05:45:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:59,053 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 587 transitions. [2019-09-09 05:45:59,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 587 transitions. [2019-09-09 05:45:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:45:59,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:59,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:59,054 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1919604502, now seen corresponding path program 1 times [2019-09-09 05:45:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:45:59,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:59,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:59,113 INFO L87 Difference]: Start difference. First operand 449 states and 587 transitions. Second operand 5 states. [2019-09-09 05:45:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:59,684 INFO L93 Difference]: Finished difference Result 576 states and 787 transitions. [2019-09-09 05:45:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:59,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:45:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:59,688 INFO L225 Difference]: With dead ends: 576 [2019-09-09 05:45:59,688 INFO L226 Difference]: Without dead ends: 561 [2019-09-09 05:45:59,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-09 05:45:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-09-09 05:45:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-09 05:45:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 567 transitions. [2019-09-09 05:45:59,702 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 567 transitions. Word has length 49 [2019-09-09 05:45:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:59,703 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 567 transitions. [2019-09-09 05:45:59,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 567 transitions. [2019-09-09 05:45:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:59,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:59,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:59,704 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-09-09 05:45:59,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:45:59,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:59,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:59,752 INFO L87 Difference]: Start difference. First operand 434 states and 567 transitions. Second operand 6 states. [2019-09-09 05:45:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:59,785 INFO L93 Difference]: Finished difference Result 446 states and 580 transitions. [2019-09-09 05:45:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:59,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-09 05:45:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:59,789 INFO L225 Difference]: With dead ends: 446 [2019-09-09 05:45:59,789 INFO L226 Difference]: Without dead ends: 416 [2019-09-09 05:45:59,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:45:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-09 05:45:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-09 05:45:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-09 05:45:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 547 transitions. [2019-09-09 05:45:59,800 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 547 transitions. Word has length 50 [2019-09-09 05:45:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:59,801 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 547 transitions. [2019-09-09 05:45:59,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 547 transitions. [2019-09-09 05:45:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:59,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:59,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:59,802 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 519699838, now seen corresponding path program 1 times [2019-09-09 05:45:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:59,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:45:59,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:59,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:45:59,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:59,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:59,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:59,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:59,867 INFO L87 Difference]: Start difference. First operand 416 states and 547 transitions. Second operand 8 states. [2019-09-09 05:46:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:00,005 INFO L93 Difference]: Finished difference Result 427 states and 559 transitions. [2019-09-09 05:46:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:00,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-09 05:46:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:00,007 INFO L225 Difference]: With dead ends: 427 [2019-09-09 05:46:00,008 INFO L226 Difference]: Without dead ends: 399 [2019-09-09 05:46:00,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-09 05:46:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-09-09 05:46:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-09 05:46:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 526 transitions. [2019-09-09 05:46:00,018 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 526 transitions. Word has length 50 [2019-09-09 05:46:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:00,018 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 526 transitions. [2019-09-09 05:46:00,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 526 transitions. [2019-09-09 05:46:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:00,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:00,019 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1637476579, now seen corresponding path program 1 times [2019-09-09 05:46:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:00,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:00,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:00,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:00,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:00,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:00,086 INFO L87 Difference]: Start difference. First operand 399 states and 526 transitions. Second operand 8 states. [2019-09-09 05:46:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:00,192 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2019-09-09 05:46:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:00,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-09 05:46:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:00,195 INFO L225 Difference]: With dead ends: 426 [2019-09-09 05:46:00,195 INFO L226 Difference]: Without dead ends: 408 [2019-09-09 05:46:00,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-09 05:46:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-09-09 05:46:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-09 05:46:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 529 transitions. [2019-09-09 05:46:00,233 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 529 transitions. Word has length 51 [2019-09-09 05:46:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:00,234 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 529 transitions. [2019-09-09 05:46:00,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 529 transitions. [2019-09-09 05:46:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:00,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:00,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:00,235 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-09-09 05:46:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:00,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:00,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:00,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:00,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:00,271 INFO L87 Difference]: Start difference. First operand 400 states and 529 transitions. Second operand 4 states. [2019-09-09 05:46:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:00,295 INFO L93 Difference]: Finished difference Result 410 states and 540 transitions. [2019-09-09 05:46:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:00,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-09 05:46:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:00,298 INFO L225 Difference]: With dead ends: 410 [2019-09-09 05:46:00,299 INFO L226 Difference]: Without dead ends: 410 [2019-09-09 05:46:00,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-09 05:46:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-09-09 05:46:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-09 05:46:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 533 transitions. [2019-09-09 05:46:00,309 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 533 transitions. Word has length 51 [2019-09-09 05:46:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:00,310 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 533 transitions. [2019-09-09 05:46:00,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 533 transitions. [2019-09-09 05:46:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:00,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:00,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:00,311 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-09-09 05:46:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:00,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:00,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:00,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:00,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:00,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:00,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:00,373 INFO L87 Difference]: Start difference. First operand 403 states and 533 transitions. Second operand 7 states. [2019-09-09 05:46:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:01,035 INFO L93 Difference]: Finished difference Result 511 states and 726 transitions. [2019-09-09 05:46:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:01,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-09 05:46:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:01,039 INFO L225 Difference]: With dead ends: 511 [2019-09-09 05:46:01,039 INFO L226 Difference]: Without dead ends: 511 [2019-09-09 05:46:01,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-09 05:46:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-09-09 05:46:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-09 05:46:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 716 transitions. [2019-09-09 05:46:01,057 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 716 transitions. Word has length 51 [2019-09-09 05:46:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:01,057 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 716 transitions. [2019-09-09 05:46:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 716 transitions. [2019-09-09 05:46:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:01,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:01,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:01,059 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-09-09 05:46:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:01,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:01,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:01,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:01,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:01,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:01,102 INFO L87 Difference]: Start difference. First operand 503 states and 716 transitions. Second operand 3 states. [2019-09-09 05:46:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:01,216 INFO L93 Difference]: Finished difference Result 657 states and 987 transitions. [2019-09-09 05:46:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:01,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-09 05:46:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:01,223 INFO L225 Difference]: With dead ends: 657 [2019-09-09 05:46:01,223 INFO L226 Difference]: Without dead ends: 657 [2019-09-09 05:46:01,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-09 05:46:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 575. [2019-09-09 05:46:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-09 05:46:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 845 transitions. [2019-09-09 05:46:01,251 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 845 transitions. Word has length 51 [2019-09-09 05:46:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:01,251 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 845 transitions. [2019-09-09 05:46:01,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 845 transitions. [2019-09-09 05:46:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:01,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:01,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:01,252 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-09-09 05:46:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:01,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:01,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:01,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:01,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:01,318 INFO L87 Difference]: Start difference. First operand 575 states and 845 transitions. Second operand 8 states. [2019-09-09 05:46:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:01,363 INFO L93 Difference]: Finished difference Result 595 states and 866 transitions. [2019-09-09 05:46:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:01,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-09 05:46:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:01,367 INFO L225 Difference]: With dead ends: 595 [2019-09-09 05:46:01,368 INFO L226 Difference]: Without dead ends: 574 [2019-09-09 05:46:01,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-09 05:46:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-09 05:46:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-09 05:46:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 843 transitions. [2019-09-09 05:46:01,394 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 843 transitions. Word has length 52 [2019-09-09 05:46:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:01,395 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 843 transitions. [2019-09-09 05:46:01,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 843 transitions. [2019-09-09 05:46:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:46:01,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:01,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:01,396 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-09-09 05:46:01,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:01,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:01,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:01,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:01,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:01,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:01,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:01,465 INFO L87 Difference]: Start difference. First operand 574 states and 843 transitions. Second operand 5 states. [2019-09-09 05:46:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:01,962 INFO L93 Difference]: Finished difference Result 654 states and 981 transitions. [2019-09-09 05:46:01,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:01,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-09 05:46:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:01,966 INFO L225 Difference]: With dead ends: 654 [2019-09-09 05:46:01,967 INFO L226 Difference]: Without dead ends: 622 [2019-09-09 05:46:01,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-09 05:46:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 542. [2019-09-09 05:46:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-09 05:46:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 806 transitions. [2019-09-09 05:46:01,985 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 806 transitions. Word has length 53 [2019-09-09 05:46:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:01,985 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 806 transitions. [2019-09-09 05:46:01,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 806 transitions. [2019-09-09 05:46:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:46:01,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:01,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:01,987 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-09-09 05:46:01,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:01,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:01,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:01,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:02,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:02,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:02,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:02,028 INFO L87 Difference]: Start difference. First operand 542 states and 806 transitions. Second operand 3 states. [2019-09-09 05:46:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:02,070 INFO L93 Difference]: Finished difference Result 527 states and 772 transitions. [2019-09-09 05:46:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:02,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-09 05:46:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:02,074 INFO L225 Difference]: With dead ends: 527 [2019-09-09 05:46:02,075 INFO L226 Difference]: Without dead ends: 527 [2019-09-09 05:46:02,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-09 05:46:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-09 05:46:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-09 05:46:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 772 transitions. [2019-09-09 05:46:02,091 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 772 transitions. Word has length 58 [2019-09-09 05:46:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:02,091 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 772 transitions. [2019-09-09 05:46:02,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 772 transitions. [2019-09-09 05:46:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:46:02,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:02,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:02,093 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 651288929, now seen corresponding path program 1 times [2019-09-09 05:46:02,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:02,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:02,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-09 05:46:02,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:02,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:46:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:46:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:02,184 INFO L87 Difference]: Start difference. First operand 527 states and 772 transitions. Second operand 10 states. [2019-09-09 05:46:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:02,578 INFO L93 Difference]: Finished difference Result 526 states and 770 transitions. [2019-09-09 05:46:02,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:46:02,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-09-09 05:46:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:02,582 INFO L225 Difference]: With dead ends: 526 [2019-09-09 05:46:02,582 INFO L226 Difference]: Without dead ends: 466 [2019-09-09 05:46:02,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-09 05:46:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-09 05:46:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:46:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-09-09 05:46:02,598 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 57 [2019-09-09 05:46:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:02,598 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-09-09 05:46:02,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:46:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-09-09 05:46:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:02,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:02,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:02,600 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-09-09 05:46:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:02,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:02,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:02,718 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-09-09 05:46:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:02,760 INFO L93 Difference]: Finished difference Result 491 states and 773 transitions. [2019-09-09 05:46:02,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:02,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-09 05:46:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:02,764 INFO L225 Difference]: With dead ends: 491 [2019-09-09 05:46:02,764 INFO L226 Difference]: Without dead ends: 491 [2019-09-09 05:46:02,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-09 05:46:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-09-09 05:46:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-09 05:46:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2019-09-09 05:46:02,779 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2019-09-09 05:46:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:02,779 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2019-09-09 05:46:02,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2019-09-09 05:46:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:02,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:02,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:02,782 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:02,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-09-09 05:46:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:02,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:02,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:02,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:02,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:02,828 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2019-09-09 05:46:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:02,893 INFO L93 Difference]: Finished difference Result 727 states and 1186 transitions. [2019-09-09 05:46:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:02,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-09 05:46:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:02,898 INFO L225 Difference]: With dead ends: 727 [2019-09-09 05:46:02,898 INFO L226 Difference]: Without dead ends: 727 [2019-09-09 05:46:02,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-09 05:46:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2019-09-09 05:46:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-09 05:46:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2019-09-09 05:46:02,919 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2019-09-09 05:46:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:02,920 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2019-09-09 05:46:02,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2019-09-09 05:46:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:46:02,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:02,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:02,924 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash -554950542, now seen corresponding path program 1 times [2019-09-09 05:46:02,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:02,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:02,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:02,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:02,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:02,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:02,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:02,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:02,998 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 5 states. [2019-09-09 05:46:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:03,532 INFO L93 Difference]: Finished difference Result 877 states and 1493 transitions. [2019-09-09 05:46:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:03,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-09 05:46:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:03,538 INFO L225 Difference]: With dead ends: 877 [2019-09-09 05:46:03,539 INFO L226 Difference]: Without dead ends: 877 [2019-09-09 05:46:03,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-09-09 05:46:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 558. [2019-09-09 05:46:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-09 05:46:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 886 transitions. [2019-09-09 05:46:03,565 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 886 transitions. Word has length 64 [2019-09-09 05:46:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:03,565 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 886 transitions. [2019-09-09 05:46:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 886 transitions. [2019-09-09 05:46:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:46:03,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:03,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:03,567 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-09-09 05:46:03,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:03,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:03,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:03,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:03,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:03,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:03,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:03,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:03,701 INFO L87 Difference]: Start difference. First operand 558 states and 886 transitions. Second operand 6 states. [2019-09-09 05:46:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:03,735 INFO L93 Difference]: Finished difference Result 370 states and 530 transitions. [2019-09-09 05:46:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:03,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-09 05:46:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:03,738 INFO L225 Difference]: With dead ends: 370 [2019-09-09 05:46:03,738 INFO L226 Difference]: Without dead ends: 370 [2019-09-09 05:46:03,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-09 05:46:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2019-09-09 05:46:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:46:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 487 transitions. [2019-09-09 05:46:03,749 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 487 transitions. Word has length 65 [2019-09-09 05:46:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:03,749 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 487 transitions. [2019-09-09 05:46:03,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 487 transitions. [2019-09-09 05:46:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-09 05:46:03,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:03,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:03,751 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-09-09 05:46:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:03,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:03,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:03,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:03,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:03,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:03,829 INFO L87 Difference]: Start difference. First operand 340 states and 487 transitions. Second operand 5 states. [2019-09-09 05:46:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:04,043 INFO L93 Difference]: Finished difference Result 307 states and 420 transitions. [2019-09-09 05:46:04,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:04,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-09 05:46:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:04,046 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:46:04,046 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:46:04,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:46:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-09-09 05:46:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-09 05:46:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2019-09-09 05:46:04,060 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2019-09-09 05:46:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:04,061 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2019-09-09 05:46:04,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2019-09-09 05:46:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:46:04,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:04,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:04,063 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 339483206, now seen corresponding path program 1 times [2019-09-09 05:46:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:04,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:04,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:04,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:04,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:04,124 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 3 states. [2019-09-09 05:46:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:04,135 INFO L93 Difference]: Finished difference Result 313 states and 434 transitions. [2019-09-09 05:46:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:04,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-09 05:46:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:04,137 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:46:04,137 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:46:04,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:46:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2019-09-09 05:46:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-09 05:46:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-09-09 05:46:04,148 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 70 [2019-09-09 05:46:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:04,150 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-09-09 05:46:04,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-09-09 05:46:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:46:04,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:04,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:04,152 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-09-09 05:46:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:04,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:04,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:04,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:04,279 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 7 states. [2019-09-09 05:46:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:04,795 INFO L93 Difference]: Finished difference Result 381 states and 528 transitions. [2019-09-09 05:46:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:46:04,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-09 05:46:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:04,798 INFO L225 Difference]: With dead ends: 381 [2019-09-09 05:46:04,798 INFO L226 Difference]: Without dead ends: 381 [2019-09-09 05:46:04,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-09 05:46:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 307. [2019-09-09 05:46:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-09 05:46:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-09-09 05:46:04,808 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-09-09 05:46:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:04,808 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-09-09 05:46:04,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-09-09 05:46:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:46:04,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:04,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:04,809 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-09-09 05:46:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:04,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:04,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:04,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:04,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:04,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:04,913 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-09-09 05:46:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:05,422 INFO L93 Difference]: Finished difference Result 407 states and 555 transitions. [2019-09-09 05:46:05,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:05,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-09 05:46:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:05,425 INFO L225 Difference]: With dead ends: 407 [2019-09-09 05:46:05,425 INFO L226 Difference]: Without dead ends: 407 [2019-09-09 05:46:05,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-09 05:46:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-09-09 05:46:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-09 05:46:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-09-09 05:46:05,437 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-09-09 05:46:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:05,437 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-09-09 05:46:05,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-09-09 05:46:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:46:05,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:05,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:05,438 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-09-09 05:46:05,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:05,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:05,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:05,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:05,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:05,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:05,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:05,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:05,571 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-09-09 05:46:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:05,610 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2019-09-09 05:46:05,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:05,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-09 05:46:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:05,614 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:46:05,614 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:46:05,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:46:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-09 05:46:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-09 05:46:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-09-09 05:46:05,627 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-09-09 05:46:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:05,628 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-09-09 05:46:05,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-09-09 05:46:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:46:05,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:05,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:05,630 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-09-09 05:46:05,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:05,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:05,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:05,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:05,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:05,716 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-09-09 05:46:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:06,117 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2019-09-09 05:46:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:46:06,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-09 05:46:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:06,119 INFO L225 Difference]: With dead ends: 337 [2019-09-09 05:46:06,121 INFO L226 Difference]: Without dead ends: 337 [2019-09-09 05:46:06,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-09 05:46:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-09-09 05:46:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-09 05:46:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-09-09 05:46:06,132 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-09-09 05:46:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:06,134 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-09-09 05:46:06,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-09-09 05:46:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-09 05:46:06,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:06,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:06,136 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-09-09 05:46:06,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:06,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:06,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-09 05:46:06,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:06,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:46:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:46:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:46:06,290 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-09-09 05:46:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:06,438 INFO L93 Difference]: Finished difference Result 354 states and 462 transitions. [2019-09-09 05:46:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:46:06,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-09-09 05:46:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:06,441 INFO L225 Difference]: With dead ends: 354 [2019-09-09 05:46:06,441 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:46:06,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:46:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:46:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-09 05:46:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-09 05:46:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-09-09 05:46:06,450 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-09-09 05:46:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:06,451 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-09-09 05:46:06,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:46:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-09-09 05:46:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:46:06,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:06,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:06,453 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-09-09 05:46:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:06,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:06,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:06,512 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-09-09 05:46:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:06,832 INFO L93 Difference]: Finished difference Result 458 states and 578 transitions. [2019-09-09 05:46:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:06,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:46:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:06,836 INFO L225 Difference]: With dead ends: 458 [2019-09-09 05:46:06,836 INFO L226 Difference]: Without dead ends: 458 [2019-09-09 05:46:06,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-09 05:46:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-09-09 05:46:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-09 05:46:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-09-09 05:46:06,847 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-09-09 05:46:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:06,848 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-09-09 05:46:06,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-09-09 05:46:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:46:06,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:06,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:06,850 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-09-09 05:46:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:06,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:46:07,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:07,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:46:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:46:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:07,036 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-09-09 05:46:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:09,044 INFO L93 Difference]: Finished difference Result 813 states and 1032 transitions. [2019-09-09 05:46:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-09 05:46:09,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-09 05:46:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:09,049 INFO L225 Difference]: With dead ends: 813 [2019-09-09 05:46:09,049 INFO L226 Difference]: Without dead ends: 774 [2019-09-09 05:46:09,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-09 05:46:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-09 05:46:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-09-09 05:46:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-09 05:46:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-09-09 05:46:09,063 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-09-09 05:46:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:09,063 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-09-09 05:46:09,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:46:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-09-09 05:46:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:46:09,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:09,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:09,065 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-09-09 05:46:09,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:09,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:09,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:46:09,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:09,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:46:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:46:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:09,222 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-09-09 05:46:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:11,938 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2019-09-09 05:46:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-09 05:46:11,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-09 05:46:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:11,943 INFO L225 Difference]: With dead ends: 794 [2019-09-09 05:46:11,943 INFO L226 Difference]: Without dead ends: 755 [2019-09-09 05:46:11,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:46:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-09 05:46:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-09-09 05:46:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:46:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-09-09 05:46:11,955 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-09-09 05:46:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:11,956 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-09-09 05:46:11,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:46:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-09-09 05:46:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:46:11,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:11,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:11,958 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-09-09 05:46:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:11,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:12,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:12,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-09 05:46:12,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:12,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:46:12,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:46:12,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:46:12,155 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-09-09 05:46:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:12,347 INFO L93 Difference]: Finished difference Result 420 states and 531 transitions. [2019-09-09 05:46:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:46:12,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-09 05:46:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:12,351 INFO L225 Difference]: With dead ends: 420 [2019-09-09 05:46:12,351 INFO L226 Difference]: Without dead ends: 396 [2019-09-09 05:46:12,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:46:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-09 05:46:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-09-09 05:46:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-09 05:46:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-09-09 05:46:12,364 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-09-09 05:46:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:12,365 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-09-09 05:46:12,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:46:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-09-09 05:46:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:46:12,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:12,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:12,368 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-09-09 05:46:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:12,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:12,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:12,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:46:12,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:12,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:46:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:46:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:12,549 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-09-09 05:46:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:14,590 INFO L93 Difference]: Finished difference Result 778 states and 984 transitions. [2019-09-09 05:46:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-09 05:46:14,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-09 05:46:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:14,596 INFO L225 Difference]: With dead ends: 778 [2019-09-09 05:46:14,596 INFO L226 Difference]: Without dead ends: 719 [2019-09-09 05:46:14,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-09 05:46:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-09 05:46:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-09-09 05:46:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-09 05:46:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-09-09 05:46:14,616 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-09-09 05:46:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:14,616 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-09-09 05:46:14,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:46:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-09-09 05:46:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:46:14,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:14,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:14,619 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-09-09 05:46:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:14,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:14,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:14,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:46:14,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:14,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:46:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:46:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:14,821 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-09-09 05:46:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:17,477 INFO L93 Difference]: Finished difference Result 678 states and 834 transitions. [2019-09-09 05:46:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-09 05:46:17,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-09 05:46:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:17,481 INFO L225 Difference]: With dead ends: 678 [2019-09-09 05:46:17,481 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:46:17,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-09 05:46:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:46:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-09-09 05:46:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-09 05:46:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-09-09 05:46:17,493 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-09-09 05:46:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:17,493 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-09-09 05:46:17,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:46:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-09-09 05:46:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:46:17,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:17,495 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:17,495 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-09-09 05:46:17,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:17,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:17,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:46:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:17,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:17,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:17,616 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-09-09 05:46:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:17,695 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-09-09 05:46:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:17,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-09 05:46:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:17,699 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:46:17,699 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:46:17,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:46:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-09-09 05:46:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-09 05:46:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-09-09 05:46:17,724 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-09-09 05:46:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:17,725 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-09-09 05:46:17,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-09-09 05:46:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:46:17,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:17,727 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:17,729 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-09-09 05:46:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:17,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:17,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:17,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:46:17,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:17,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:46:17,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-09 05:46:17,908 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [338], [342], [348], [354], [356], [358], [365], [367], [368], [369], [371], [375], [377], [384], [388], [392], [394], [398], [400], [407], [409], [434], [438], [484], [537], [542], [544], [545], [546], [549], [552], [554], [560], [563], [571], [574], [576], [581], [584], [588], [596], [599], [602], [604], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [745], [746], [747], [753], [754], [757], [758], [759], [760], [763], [764], [765], [766], [793], [794], [795], [796], [799], [800], [805], [811], [812], [813] [2019-09-09 05:46:17,993 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:46:17,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:46:18,244 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:46:18,574 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:46:18,583 INFO L272 AbstractInterpreter]: Visited 88 different actions 208 times. Merged at 18 different actions 38 times. Never widened. Performed 1812 root evaluator evaluations with a maximum evaluation depth of 12. Performed 1812 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 2 fixpoints after 1 different actions. Largest state had 98 variables. [2019-09-09 05:46:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:18,588 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:46:18,937 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 85.01% of their original sizes. [2019-09-09 05:46:18,937 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:46:23,088 INFO L420 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2019-09-09 05:46:23,088 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:46:23,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:46:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [6] total 80 [2019-09-09 05:46:23,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-09 05:46:23,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-09 05:46:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5426, Unknown=0, NotChecked=0, Total=5700 [2019-09-09 05:46:23,093 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 76 states. [2019-09-09 05:47:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,595 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2019-09-09 05:47:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-09 05:47:01,595 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 163 [2019-09-09 05:47:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,597 INFO L225 Difference]: With dead ends: 371 [2019-09-09 05:47:01,597 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:47:01,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5381 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1173, Invalid=21779, Unknown=0, NotChecked=0, Total=22952 [2019-09-09 05:47:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:47:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 283. [2019-09-09 05:47:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:47:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 331 transitions. [2019-09-09 05:47:01,616 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 331 transitions. Word has length 163 [2019-09-09 05:47:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,617 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 331 transitions. [2019-09-09 05:47:01,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-09 05:47:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 331 transitions. [2019-09-09 05:47:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:47:01,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:01,619 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:01,620 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -713455478, now seen corresponding path program 1 times [2019-09-09 05:47:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:47:01,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:47:01,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:01,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:47:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:47:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:01,707 INFO L87 Difference]: Start difference. First operand 283 states and 331 transitions. Second operand 6 states. [2019-09-09 05:47:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,748 INFO L93 Difference]: Finished difference Result 309 states and 368 transitions. [2019-09-09 05:47:01,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:47:01,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-09 05:47:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,751 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:47:01,751 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:47:01,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:47:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:47:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 276. [2019-09-09 05:47:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-09 05:47:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 316 transitions. [2019-09-09 05:47:01,760 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 316 transitions. Word has length 164 [2019-09-09 05:47:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,760 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 316 transitions. [2019-09-09 05:47:01,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:47:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 316 transitions. [2019-09-09 05:47:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:47:01,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:01,765 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:01,765 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash -469124130, now seen corresponding path program 1 times [2019-09-09 05:47:01,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-09 05:47:01,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:01,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:47:01,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:01,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:47:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:47:01,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:01,934 INFO L87 Difference]: Start difference. First operand 276 states and 316 transitions. Second operand 6 states. [2019-09-09 05:47:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,976 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2019-09-09 05:47:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:47:01,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-09-09 05:47:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,978 INFO L225 Difference]: With dead ends: 261 [2019-09-09 05:47:01,978 INFO L226 Difference]: Without dead ends: 261 [2019-09-09 05:47:01,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:47:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-09 05:47:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2019-09-09 05:47:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:47:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 280 transitions. [2019-09-09 05:47:01,996 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 280 transitions. Word has length 204 [2019-09-09 05:47:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,997 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 280 transitions. [2019-09-09 05:47:01,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:47:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 280 transitions. [2019-09-09 05:47:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-09 05:47:02,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:02,002 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:02,002 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 336725440, now seen corresponding path program 1 times [2019-09-09 05:47:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-09 05:47:02,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:47:02,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:47:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:47:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:02,228 INFO L87 Difference]: Start difference. First operand 247 states and 280 transitions. Second operand 6 states. [2019-09-09 05:47:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,255 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2019-09-09 05:47:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:47:02,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-09 05:47:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,256 INFO L225 Difference]: With dead ends: 233 [2019-09-09 05:47:02,256 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:47:02,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:47:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:47:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:47:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:47:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:47:02,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-09-09 05:47:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:02,258 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:47:02,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:47:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:47:02,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:47:02,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:47:02 BoogieIcfgContainer [2019-09-09 05:47:02,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:47:02,269 INFO L168 Benchmark]: Toolchain (without parser) took 70242.27 ms. Allocated memory was 138.9 MB in the beginning and 776.5 MB in the end (delta: 637.5 MB). Free memory was 85.3 MB in the beginning and 693.3 MB in the end (delta: -608.0 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:02,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:47:02,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.58 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 85.1 MB in the beginning and 165.2 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:02,272 INFO L168 Benchmark]: Boogie Preprocessor took 79.70 ms. Allocated memory is still 198.2 MB. Free memory was 165.2 MB in the beginning and 161.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:02,272 INFO L168 Benchmark]: RCFGBuilder took 1067.54 ms. Allocated memory is still 198.2 MB. Free memory was 161.3 MB in the beginning and 77.2 MB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:02,274 INFO L168 Benchmark]: TraceAbstraction took 68333.93 ms. Allocated memory was 198.2 MB in the beginning and 776.5 MB in the end (delta: 578.3 MB). Free memory was 77.2 MB in the beginning and 693.3 MB in the end (delta: -616.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:47:02,283 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.58 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 85.1 MB in the beginning and 165.2 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.70 ms. Allocated memory is still 198.2 MB. Free memory was 165.2 MB in the beginning and 161.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1067.54 ms. Allocated memory is still 198.2 MB. Free memory was 161.3 MB in the beginning and 77.2 MB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68333.93 ms. Allocated memory was 198.2 MB in the beginning and 776.5 MB in the end (delta: 578.3 MB). Free memory was 77.2 MB in the beginning and 693.3 MB in the end (delta: -616.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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 27 procedures, 295 locations, 1 error locations. SAFE Result, 68.2s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 56.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14578 SDtfs, 10527 SDslu, 38304 SDs, 0 SdLazy, 21886 SolverSat, 2964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5886 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9646914365862156 AbsIntWeakeningRatio, 2.1419753086419755 AbsIntAvgWeakeningVarsNumRemoved, 13.530864197530864 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 49 MinimizatonAttempts, 2703 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3517 NumberOfCodeBlocks, 3517 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 503356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 48 PerfectInterpolantSequences, 553/559 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...