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-fea9116 [2019-09-20 13:26:39,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:39,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:39,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:39,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:39,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:39,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:39,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:39,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:39,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:39,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:39,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:39,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:39,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:39,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:39,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:39,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:39,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:39,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:39,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:39,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:39,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:39,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:39,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:39,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:39,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:39,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:39,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:39,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:39,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:39,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:39,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:39,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:39,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:39,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:39,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:39,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:39,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:39,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:39,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:39,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:39,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:39,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:39,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:39,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:39,887 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:39,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:39,888 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:39,888 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:39,888 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:39,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:39,889 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:39,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:39,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:39,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:39,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:39,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:39,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:39,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:39,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:39,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:39,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:39,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:39,891 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:39,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:39,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:39,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:39,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:39,892 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:39,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:39,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:39,893 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:39,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:39,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:39,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:39,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:39,944 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:39,945 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-09-20 13:26:40,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6d145ad/3d0f62a1c2014ca78d994950d8a6dbe9/FLAGd1759ba10 [2019-09-20 13:26:40,529 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:40,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-09-20 13:26:40,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6d145ad/3d0f62a1c2014ca78d994950d8a6dbe9/FLAGd1759ba10 [2019-09-20 13:26:40,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6d145ad/3d0f62a1c2014ca78d994950d8a6dbe9 [2019-09-20 13:26:40,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:40,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:40,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:40,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:40,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:40,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40, skipping insertion in model container [2019-09-20 13:26:40,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:40,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:41,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:41,309 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:41,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:41,402 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:41,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41 WrapperNode [2019-09-20 13:26:41,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:41,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:41,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:41,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:41,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:41,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:41,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:41,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:41,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:41,526 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:41,526 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-20 13:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-09-20 13:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-09-20 13:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-09-20 13:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 13:26:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-09-20 13:26:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:41,811 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,891 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 13:26:41,891 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 13:26:41,912 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,051 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-20 13:26:42,052 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-20 13:26:42,053 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,101 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-20 13:26:42,101 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-20 13:26:42,109 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,145 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-20 13:26:42,145 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-20 13:26:42,246 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,268 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:42,269 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:42,291 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,376 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-20 13:26:42,376 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-20 13:26:42,384 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:42,385 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:26:42,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42 BoogieIcfgContainer [2019-09-20 13:26:42,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:42,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:42,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:42,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:42,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:40" (1/3) ... [2019-09-20 13:26:42,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b608c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (2/3) ... [2019-09-20 13:26:42,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b608c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42" (3/3) ... [2019-09-20 13:26:42,409 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-09-20 13:26:42,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:42,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:42,447 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:42,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:42,478 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:42,479 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:42,480 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:42,480 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:42,480 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:42,481 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:42,481 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-09-20 13:26:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:42,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,516 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:42,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-09-20 13:26:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,785 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2019-09-20 13:26:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,937 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2019-09-20 13:26:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,968 INFO L225 Difference]: With dead ends: 240 [2019-09-20 13:26:42,968 INFO L226 Difference]: Without dead ends: 228 [2019-09-20 13:26:42,972 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-20 13:26:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-09-20 13:26:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-20 13:26:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-09-20 13:26:43,082 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-09-20 13:26:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,082 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-09-20 13:26:43,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-09-20 13:26:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:43,084 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,084 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,084 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-09-20 13:26:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,311 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2019-09-20 13:26:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,482 INFO L93 Difference]: Finished difference Result 309 states and 420 transitions. [2019-09-20 13:26:43,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,486 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:26:43,486 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:26:43,487 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:26:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2019-09-20 13:26:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-20 13:26:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2019-09-20 13:26:43,511 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2019-09-20 13:26:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,512 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2019-09-20 13:26:43,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2019-09-20 13:26:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:43,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,514 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,514 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-09-20 13:26:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,624 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2019-09-20 13:26:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,653 INFO L93 Difference]: Finished difference Result 356 states and 479 transitions. [2019-09-20 13:26:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,661 INFO L225 Difference]: With dead ends: 356 [2019-09-20 13:26:43,662 INFO L226 Difference]: Without dead ends: 356 [2019-09-20 13:26:43,662 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-20 13:26:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2019-09-20 13:26:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-20 13:26:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2019-09-20 13:26:43,700 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2019-09-20 13:26:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,701 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2019-09-20 13:26:43,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2019-09-20 13:26:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:26:43,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,712 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,712 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-09-20 13:26:43,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,817 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2019-09-20 13:26:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,907 INFO L93 Difference]: Finished difference Result 334 states and 452 transitions. [2019-09-20 13:26:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-20 13:26:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,910 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:26:43,910 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:26:43,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:26:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-09-20 13:26:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-20 13:26:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2019-09-20 13:26:43,927 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2019-09-20 13:26:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,927 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2019-09-20 13:26:43,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2019-09-20 13:26:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:43,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,930 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,931 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-09-20 13:26:43,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:44,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:44,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:44,019 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2019-09-20 13:26:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,149 INFO L93 Difference]: Finished difference Result 313 states and 416 transitions. [2019-09-20 13:26:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:44,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-09-20 13:26:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,152 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:26:44,153 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:26:44,153 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:26:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2019-09-20 13:26:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-20 13:26:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2019-09-20 13:26:44,167 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2019-09-20 13:26:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,168 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2019-09-20 13:26:44,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2019-09-20 13:26:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:26:44,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,170 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,170 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-09-20 13:26:44,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,268 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2019-09-20 13:26:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,289 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2019-09-20 13:26:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:26:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,291 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:26:44,291 INFO L226 Difference]: Without dead ends: 102 [2019-09-20 13:26:44,291 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-20 13:26:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-20 13:26:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-20 13:26:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-09-20 13:26:44,296 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-09-20 13:26:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,298 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-09-20 13:26:44,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-09-20 13:26:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:44,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,300 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,300 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-09-20 13:26:44,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,369 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2019-09-20 13:26:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,395 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-09-20 13:26:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:26:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,397 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:26:44,398 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:26:44,398 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:26:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-20 13:26:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:26:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-09-20 13:26:44,403 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-09-20 13:26:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,404 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-09-20 13:26:44,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-09-20 13:26:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:26:44,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,405 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,406 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-09-20 13:26:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:44,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:44,487 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2019-09-20 13:26:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,533 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2019-09-20 13:26:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:44,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-20 13:26:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,535 INFO L225 Difference]: With dead ends: 118 [2019-09-20 13:26:44,535 INFO L226 Difference]: Without dead ends: 111 [2019-09-20 13:26:44,535 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-20 13:26:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-09-20 13:26:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-20 13:26:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-09-20 13:26:44,542 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-09-20 13:26:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,542 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-09-20 13:26:44,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-09-20 13:26:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:26:44,543 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,543 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,544 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-09-20 13:26:44,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:44,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:44,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:44,634 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2019-09-20 13:26:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,688 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-20 13:26:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:44,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-20 13:26:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,689 INFO L225 Difference]: With dead ends: 109 [2019-09-20 13:26:44,690 INFO L226 Difference]: Without dead ends: 109 [2019-09-20 13:26:44,690 INFO L636 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-09-20 13:26:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-20 13:26:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-09-20 13:26:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-20 13:26:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-09-20 13:26:44,696 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-09-20 13:26:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,697 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-09-20 13:26:44,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-09-20 13:26:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:26:44,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,698 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-09-20 13:26:44,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,752 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2019-09-20 13:26:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,780 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-09-20 13:26:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-20 13:26:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,782 INFO L225 Difference]: With dead ends: 119 [2019-09-20 13:26:44,782 INFO L226 Difference]: Without dead ends: 117 [2019-09-20 13:26:44,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-20 13:26:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-09-20 13:26:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-20 13:26:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-09-20 13:26:44,786 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-09-20 13:26:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,787 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-09-20 13:26:44,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-09-20 13:26:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:26:44,788 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,788 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,788 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-09-20 13:26:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:44,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:44,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,873 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2019-09-20 13:26:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,884 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-09-20 13:26:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:44,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-20 13:26:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,887 INFO L225 Difference]: With dead ends: 102 [2019-09-20 13:26:44,887 INFO L226 Difference]: Without dead ends: 102 [2019-09-20 13:26:44,888 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-20 13:26:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-20 13:26:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-20 13:26:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-09-20 13:26:44,893 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-09-20 13:26:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,894 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-09-20 13:26:44,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-09-20 13:26:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:26:44,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,895 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,895 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-09-20 13:26:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:44,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:44,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,998 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2019-09-20 13:26:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,129 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-09-20 13:26:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:45,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-20 13:26:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,131 INFO L225 Difference]: With dead ends: 96 [2019-09-20 13:26:45,131 INFO L226 Difference]: Without dead ends: 94 [2019-09-20 13:26:45,132 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-20 13:26:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-20 13:26:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:26:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-09-20 13:26:45,141 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-09-20 13:26:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,142 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-09-20 13:26:45,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-09-20 13:26:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:26:45,147 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,147 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,147 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-09-20 13:26:45,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,216 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2019-09-20 13:26:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,232 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-09-20 13:26:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-20 13:26:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,234 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:26:45,234 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:26:45,234 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:26:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-09-20 13:26:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:26:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-09-20 13:26:45,239 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-09-20 13:26:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,239 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-09-20 13:26:45,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-09-20 13:26:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:26:45,242 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,242 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,242 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-09-20 13:26:45,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:26:45,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:26:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:26:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:45,315 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2019-09-20 13:26:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,358 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-09-20 13:26:45,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:45,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-20 13:26:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,360 INFO L225 Difference]: With dead ends: 97 [2019-09-20 13:26:45,361 INFO L226 Difference]: Without dead ends: 97 [2019-09-20 13:26:45,361 INFO L636 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-09-20 13:26:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-20 13:26:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-20 13:26:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:26:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-09-20 13:26:45,365 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-09-20 13:26:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,365 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-09-20 13:26:45,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:26:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-09-20 13:26:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:26:45,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,366 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,367 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-09-20 13:26:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:26:45,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:26:45,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:26:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:45,580 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 11 states. [2019-09-20 13:26:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,842 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-09-20 13:26:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:26:45,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-09-20 13:26:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,844 INFO L225 Difference]: With dead ends: 103 [2019-09-20 13:26:45,844 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 13:26:45,844 INFO L636 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-09-20 13:26:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 13:26:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-09-20 13:26:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-20 13:26:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-09-20 13:26:45,848 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-09-20 13:26:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,848 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-09-20 13:26:45,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:26:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-09-20 13:26:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:26:45,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,849 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,849 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-09-20 13:26:45,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:45,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:45,960 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2019-09-20 13:26:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,056 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-09-20 13:26:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:46,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:26:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,058 INFO L225 Difference]: With dead ends: 79 [2019-09-20 13:26:46,058 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:26:46,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:26:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-20 13:26:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-20 13:26:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-20 13:26:46,062 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-09-20 13:26:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-20 13:26:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-20 13:26:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:26:46,063 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,063 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,064 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-09-20 13:26:46,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:46,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:46,157 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-09-20 13:26:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,199 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-20 13:26:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:46,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-20 13:26:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,200 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:26:46,200 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:26:46,200 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:26:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-20 13:26:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-20 13:26:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-20 13:26:46,203 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-09-20 13:26:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,204 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-20 13:26:46,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-20 13:26:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:26:46,205 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,205 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,205 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-09-20 13:26:46,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:46,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:46,281 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2019-09-20 13:26:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,360 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-20 13:26:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:46,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-20 13:26:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,361 INFO L225 Difference]: With dead ends: 60 [2019-09-20 13:26:46,361 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:46,362 INFO L636 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-09-20 13:26:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:46,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-09-20 13:26:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,363 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:46,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:46,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:46,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:46 BoogieIcfgContainer [2019-09-20 13:26:46,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:46,374 INFO L168 Benchmark]: Toolchain (without parser) took 5515.27 ms. Allocated memory was 138.4 MB in the beginning and 334.0 MB in the end (delta: 195.6 MB). Free memory was 83.9 MB in the beginning and 258.9 MB in the end (delta: -175.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:46,376 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:46,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.41 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 83.6 MB in the beginning and 167.5 MB in the end (delta: -83.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:46,381 INFO L168 Benchmark]: Boogie Preprocessor took 64.91 ms. Allocated memory is still 197.7 MB. Free memory was 167.5 MB in the beginning and 163.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:46,382 INFO L168 Benchmark]: RCFGBuilder took 917.59 ms. Allocated memory is still 197.7 MB. Free memory was 163.8 MB in the beginning and 93.1 MB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:46,383 INFO L168 Benchmark]: TraceAbstraction took 3982.09 ms. Allocated memory was 197.7 MB in the beginning and 334.0 MB in the end (delta: 136.3 MB). Free memory was 93.1 MB in the beginning and 258.9 MB in the end (delta: -165.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:26:46,388 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 545.41 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 83.6 MB in the beginning and 167.5 MB in the end (delta: -83.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.91 ms. Allocated memory is still 197.7 MB. Free memory was 167.5 MB in the beginning and 163.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 917.59 ms. Allocated memory is still 197.7 MB. Free memory was 163.8 MB in the beginning and 93.1 MB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3982.09 ms. Allocated memory was 197.7 MB in the beginning and 334.0 MB in the end (delta: 136.3 MB). Free memory was 93.1 MB in the beginning and 258.9 MB in the end (delta: -165.8 MB). There was no memory consumed. 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, 3.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2946 SDtfs, 1582 SDslu, 3365 SDs, 0 SdLazy, 658 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s 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.4s 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...