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/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:38:10,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:38:10,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:38:10,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:38:10,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:38:10,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:38:10,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:38:10,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:38:10,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:38:10,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:38:10,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:38:10,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:38:10,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:38:10,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:38:10,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:38:10,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:38:10,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:38:10,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:38:10,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:38:10,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:38:10,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:38:10,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:38:10,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:38:10,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:38:10,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:38:10,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:38:10,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:38:10,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:38:10,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:38:10,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:38:10,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:38:10,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:38:10,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:38:10,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:38:10,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:38:10,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:38:10,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:38:10,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:38:10,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:38:10,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:38:10,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:38:10,358 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-10-03 02:38:10,378 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:38:10,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:38:10,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:38:10,379 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:38:10,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:38:10,380 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:38:10,380 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:38:10,381 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:38:10,381 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:38:10,381 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:38:10,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:38:10,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:38:10,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:38:10,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:38:10,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:38:10,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:38:10,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:38:10,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:38:10,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:38:10,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:38:10,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:38:10,384 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:38:10,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:38:10,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:10,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:38:10,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:38:10,385 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:38:10,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:38:10,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:38:10,386 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:38:10,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:38:10,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:38:10,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:38:10,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:38:10,438 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:38:10,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-03 02:38:10,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d32c672/78037ef1067341528387bea39f577ac9/FLAG6761bc388 [2019-10-03 02:38:11,065 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:38:11,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-03 02:38:11,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d32c672/78037ef1067341528387bea39f577ac9/FLAG6761bc388 [2019-10-03 02:38:11,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d32c672/78037ef1067341528387bea39f577ac9 [2019-10-03 02:38:11,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:38:11,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:38:11,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:11,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:38:11,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:38:11,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:11,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239f598d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11, skipping insertion in model container [2019-10-03 02:38:11,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:11,400 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:38:11,465 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:38:11,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:11,874 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:38:11,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:11,976 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:38:11,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11 WrapperNode [2019-10-03 02:38:11,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:11,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:38:11,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:38:11,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:38:11,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:11,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... [2019-10-03 02:38:12,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:38:12,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:38:12,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:38:12,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:38:12,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:38:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:38:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:38:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:38:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:38:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-03 02:38:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-03 02:38:12,127 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:38:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:38:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:38:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:38:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:38:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:38:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:38:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:38:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:38:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:38:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:38:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:38:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:38:12,404 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:12,502 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-03 02:38:12,502 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-03 02:38:12,522 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:12,633 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-03 02:38:12,633 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-03 02:38:12,635 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:12,697 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-03 02:38:12,697 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-03 02:38:12,712 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:12,766 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-03 02:38:12,766 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-03 02:38:12,880 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:12,903 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:38:12,904 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:38:12,930 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:13,036 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-03 02:38:13,036 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-03 02:38:13,045 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:38:13,045 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:38:13,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:13 BoogieIcfgContainer [2019-10-03 02:38:13,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:38:13,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:38:13,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:38:13,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:38:13,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:38:11" (1/3) ... [2019-10-03 02:38:13,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d8aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:13, skipping insertion in model container [2019-10-03 02:38:13,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:11" (2/3) ... [2019-10-03 02:38:13,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d8aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:13, skipping insertion in model container [2019-10-03 02:38:13,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:13" (3/3) ... [2019-10-03 02:38:13,060 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-10-03 02:38:13,069 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:38:13,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:38:13,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:38:13,122 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:38:13,122 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:38:13,123 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:38:13,123 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:38:13,123 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:38:13,123 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:38:13,124 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:38:13,124 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:38:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-10-03 02:38:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:38:13,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:13,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:13,164 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-10-03 02:38:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:13,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:13,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:13,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:13,484 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2019-10-03 02:38:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:13,613 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2019-10-03 02:38:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:13,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:38:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:13,641 INFO L225 Difference]: With dead ends: 240 [2019-10-03 02:38:13,642 INFO L226 Difference]: Without dead ends: 228 [2019-10-03 02:38:13,645 INFO L640 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-10-03 02:38:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-03 02:38:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-03 02:38:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-03 02:38:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-10-03 02:38:13,709 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-10-03 02:38:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:13,710 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-10-03 02:38:13,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-10-03 02:38:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:38:13,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:13,712 INFO L411 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] [2019-10-03 02:38:13,712 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-10-03 02:38:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:13,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:13,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:13,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:13,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:13,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:13,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:13,904 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2019-10-03 02:38:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,059 INFO L93 Difference]: Finished difference Result 309 states and 420 transitions. [2019-10-03 02:38:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:38:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,063 INFO L225 Difference]: With dead ends: 309 [2019-10-03 02:38:14,063 INFO L226 Difference]: Without dead ends: 308 [2019-10-03 02:38:14,064 INFO L640 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-10-03 02:38:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-03 02:38:14,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2019-10-03 02:38:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-03 02:38:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2019-10-03 02:38:14,094 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2019-10-03 02:38:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,094 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2019-10-03 02:38:14,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2019-10-03 02:38:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:38:14,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,096 INFO L411 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] [2019-10-03 02:38:14,096 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-10-03 02:38:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:14,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,223 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2019-10-03 02:38:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,255 INFO L93 Difference]: Finished difference Result 356 states and 479 transitions. [2019-10-03 02:38:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:38:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,264 INFO L225 Difference]: With dead ends: 356 [2019-10-03 02:38:14,264 INFO L226 Difference]: Without dead ends: 356 [2019-10-03 02:38:14,265 INFO L640 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-10-03 02:38:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-03 02:38:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2019-10-03 02:38:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-03 02:38:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2019-10-03 02:38:14,305 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2019-10-03 02:38:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,305 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2019-10-03 02:38:14,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2019-10-03 02:38:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:38:14,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,310 INFO L411 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] [2019-10-03 02:38:14,311 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-10-03 02:38:14,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:14,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,442 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2019-10-03 02:38:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,526 INFO L93 Difference]: Finished difference Result 334 states and 452 transitions. [2019-10-03 02:38:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-03 02:38:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,530 INFO L225 Difference]: With dead ends: 334 [2019-10-03 02:38:14,530 INFO L226 Difference]: Without dead ends: 334 [2019-10-03 02:38:14,530 INFO L640 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-10-03 02:38:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-03 02:38:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-10-03 02:38:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-03 02:38:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2019-10-03 02:38:14,544 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2019-10-03 02:38:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,545 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2019-10-03 02:38:14,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2019-10-03 02:38:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:38:14,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,549 INFO L411 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-10-03 02:38:14,549 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-10-03 02:38:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:14,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:14,637 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2019-10-03 02:38:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,783 INFO L93 Difference]: Finished difference Result 313 states and 416 transitions. [2019-10-03 02:38:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:14,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-03 02:38:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,786 INFO L225 Difference]: With dead ends: 313 [2019-10-03 02:38:14,803 INFO L226 Difference]: Without dead ends: 313 [2019-10-03 02:38:14,803 INFO L640 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-10-03 02:38:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-03 02:38:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2019-10-03 02:38:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-03 02:38:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2019-10-03 02:38:14,829 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2019-10-03 02:38:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,834 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2019-10-03 02:38:14,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2019-10-03 02:38:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:38:14,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,841 INFO L411 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-10-03 02:38:14,841 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-10-03 02:38:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:14,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:14,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:14,921 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2019-10-03 02:38:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:14,943 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2019-10-03 02:38:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:14,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-03 02:38:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:14,945 INFO L225 Difference]: With dead ends: 291 [2019-10-03 02:38:14,945 INFO L226 Difference]: Without dead ends: 102 [2019-10-03 02:38:14,946 INFO L640 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-10-03 02:38:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-03 02:38:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-03 02:38:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-03 02:38:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-10-03 02:38:14,952 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-10-03 02:38:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:14,953 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-10-03 02:38:14,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-10-03 02:38:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:38:14,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:14,954 INFO L411 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-10-03 02:38:14,954 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-10-03 02:38:14,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:14,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:15,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:15,039 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2019-10-03 02:38:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,066 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-10-03 02:38:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:15,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-03 02:38:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,068 INFO L225 Difference]: With dead ends: 100 [2019-10-03 02:38:15,068 INFO L226 Difference]: Without dead ends: 100 [2019-10-03 02:38:15,068 INFO L640 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-10-03 02:38:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-03 02:38:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-03 02:38:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-03 02:38:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-10-03 02:38:15,072 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-10-03 02:38:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,073 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-10-03 02:38:15,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-10-03 02:38:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 02:38:15,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,074 INFO L411 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-10-03 02:38:15,075 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-10-03 02:38:15,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:15,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:15,146 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2019-10-03 02:38:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,191 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2019-10-03 02:38:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:15,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-03 02:38:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,193 INFO L225 Difference]: With dead ends: 118 [2019-10-03 02:38:15,193 INFO L226 Difference]: Without dead ends: 111 [2019-10-03 02:38:15,193 INFO L640 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-10-03 02:38:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-03 02:38:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-10-03 02:38:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-03 02:38:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-10-03 02:38:15,197 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-10-03 02:38:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,198 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-10-03 02:38:15,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-10-03 02:38:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 02:38:15,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,199 INFO L411 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-10-03 02:38:15,199 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-10-03 02:38:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:15,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:15,265 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2019-10-03 02:38:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,314 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-10-03 02:38:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:15,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-03 02:38:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,316 INFO L225 Difference]: With dead ends: 109 [2019-10-03 02:38:15,316 INFO L226 Difference]: Without dead ends: 109 [2019-10-03 02:38:15,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-03 02:38:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-10-03 02:38:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-03 02:38:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-10-03 02:38:15,321 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-10-03 02:38:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,322 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-10-03 02:38:15,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-10-03 02:38:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:38:15,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,323 INFO L411 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-10-03 02:38:15,324 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-10-03 02:38:15,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:15,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:15,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:15,375 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2019-10-03 02:38:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,404 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-10-03 02:38:15,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:15,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 02:38:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,406 INFO L225 Difference]: With dead ends: 119 [2019-10-03 02:38:15,406 INFO L226 Difference]: Without dead ends: 117 [2019-10-03 02:38:15,406 INFO L640 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-10-03 02:38:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-03 02:38:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-03 02:38:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-03 02:38:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-10-03 02:38:15,411 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-10-03 02:38:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,411 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-10-03 02:38:15,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-10-03 02:38:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:38:15,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,412 INFO L411 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-10-03 02:38:15,413 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-10-03 02:38:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:15,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:15,507 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2019-10-03 02:38:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,516 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-10-03 02:38:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:15,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-03 02:38:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,517 INFO L225 Difference]: With dead ends: 102 [2019-10-03 02:38:15,518 INFO L226 Difference]: Without dead ends: 102 [2019-10-03 02:38:15,518 INFO L640 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-10-03 02:38:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-03 02:38:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-03 02:38:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-03 02:38:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-10-03 02:38:15,521 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-10-03 02:38:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,522 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-10-03 02:38:15,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-10-03 02:38:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:15,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,523 INFO L411 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-10-03 02:38:15,523 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-10-03 02:38:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:15,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:15,590 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2019-10-03 02:38:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,817 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-10-03 02:38:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:15,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-03 02:38:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,819 INFO L225 Difference]: With dead ends: 96 [2019-10-03 02:38:15,819 INFO L226 Difference]: Without dead ends: 94 [2019-10-03 02:38:15,820 INFO L640 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-10-03 02:38:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-03 02:38:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-03 02:38:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-03 02:38:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-10-03 02:38:15,828 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-10-03 02:38:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,829 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-10-03 02:38:15,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-10-03 02:38:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:38:15,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,833 INFO L411 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-10-03 02:38:15,833 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-10-03 02:38:15,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:15,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:15,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:15,893 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2019-10-03 02:38:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:15,915 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-10-03 02:38:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:15,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-03 02:38:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:15,918 INFO L225 Difference]: With dead ends: 100 [2019-10-03 02:38:15,918 INFO L226 Difference]: Without dead ends: 100 [2019-10-03 02:38:15,918 INFO L640 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-10-03 02:38:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-03 02:38:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-10-03 02:38:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-03 02:38:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-10-03 02:38:15,923 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-10-03 02:38:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:15,924 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-10-03 02:38:15,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-10-03 02:38:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:38:15,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:15,931 INFO L411 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-10-03 02:38:15,931 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-10-03 02:38:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:15,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:16,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:16,069 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2019-10-03 02:38:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,114 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-10-03 02:38:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:16,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-10-03 02:38:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,117 INFO L225 Difference]: With dead ends: 97 [2019-10-03 02:38:16,117 INFO L226 Difference]: Without dead ends: 97 [2019-10-03 02:38:16,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-03 02:38:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-10-03 02:38:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-03 02:38:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-10-03 02:38:16,121 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-10-03 02:38:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,122 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-10-03 02:38:16,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-10-03 02:38:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:38:16,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,123 INFO L411 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-10-03 02:38:16,123 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-10-03 02:38:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:38:16,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:38:16,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:38:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:16,325 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 11 states. [2019-10-03 02:38:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,583 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-10-03 02:38:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:38:16,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-03 02:38:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,585 INFO L225 Difference]: With dead ends: 103 [2019-10-03 02:38:16,585 INFO L226 Difference]: Without dead ends: 91 [2019-10-03 02:38:16,585 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:38:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-03 02:38:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-10-03 02:38:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-03 02:38:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-10-03 02:38:16,591 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-10-03 02:38:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,592 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-10-03 02:38:16,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:38:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-10-03 02:38:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:38:16,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,593 INFO L411 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-10-03 02:38:16,593 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-10-03 02:38:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:16,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:16,750 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2019-10-03 02:38:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:16,856 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-10-03 02:38:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:16,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-03 02:38:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:16,857 INFO L225 Difference]: With dead ends: 79 [2019-10-03 02:38:16,857 INFO L226 Difference]: Without dead ends: 78 [2019-10-03 02:38:16,858 INFO L640 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-10-03 02:38:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-03 02:38:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-03 02:38:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-03 02:38:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-03 02:38:16,861 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-10-03 02:38:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:16,862 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-03 02:38:16,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-03 02:38:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:38:16,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:16,863 INFO L411 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-10-03 02:38:16,863 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-10-03 02:38:16,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:16,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:16,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:16,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:16,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:16,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:16,984 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-10-03 02:38:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,016 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-10-03 02:38:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:17,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-03 02:38:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,018 INFO L225 Difference]: With dead ends: 78 [2019-10-03 02:38:17,018 INFO L226 Difference]: Without dead ends: 78 [2019-10-03 02:38:17,020 INFO L640 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-10-03 02:38:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-03 02:38:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-03 02:38:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-03 02:38:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-03 02:38:17,025 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-10-03 02:38:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,025 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-03 02:38:17,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-03 02:38:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:38:17,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:17,028 INFO L411 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] [2019-10-03 02:38:17,028 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-10-03 02:38:17,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:17,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:17,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:17,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:17,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:17,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:17,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:17,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:17,117 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2019-10-03 02:38:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:17,199 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-10-03 02:38:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:17,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-03 02:38:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:17,201 INFO L225 Difference]: With dead ends: 60 [2019-10-03 02:38:17,201 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:38:17,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:38:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:38:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:38:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:38:17,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-10-03 02:38:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:17,203 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:38:17,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:38:17,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:38:17,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:38:17 BoogieIcfgContainer [2019-10-03 02:38:17,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:38:17,216 INFO L168 Benchmark]: Toolchain (without parser) took 5828.33 ms. Allocated memory was 141.0 MB in the beginning and 312.0 MB in the end (delta: 170.9 MB). Free memory was 88.1 MB in the beginning and 191.8 MB in the end (delta: -103.7 MB). Peak memory consumption was 67.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,218 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.67 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 87.7 MB in the beginning and 170.0 MB in the end (delta: -82.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,225 INFO L168 Benchmark]: Boogie Preprocessor took 83.20 ms. Allocated memory is still 200.8 MB. Free memory was 170.0 MB in the beginning and 167.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,226 INFO L168 Benchmark]: RCFGBuilder took 981.71 ms. Allocated memory is still 200.8 MB. Free memory was 167.0 MB in the beginning and 96.5 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,227 INFO L168 Benchmark]: TraceAbstraction took 4160.77 ms. Allocated memory was 200.8 MB in the beginning and 312.0 MB in the end (delta: 111.1 MB). Free memory was 96.5 MB in the beginning and 191.8 MB in the end (delta: -95.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:17,239 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 591.67 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 87.7 MB in the beginning and 170.0 MB in the end (delta: -82.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.20 ms. Allocated memory is still 200.8 MB. Free memory was 170.0 MB in the beginning and 167.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 981.71 ms. Allocated memory is still 200.8 MB. Free memory was 167.0 MB in the beginning and 96.5 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4160.77 ms. Allocated memory was 200.8 MB in the beginning and 312.0 MB in the end (delta: 111.1 MB). Free memory was 96.5 MB in the beginning and 191.8 MB in the end (delta: -95.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: 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 18 procedures, 239 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1582 SDslu, 3365 SDs, 0 SdLazy, 658 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 90456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...