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_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:39,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:39,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:39,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:39,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:39,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:39,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:39,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:39,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:39,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:39,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:39,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:39,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:39,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:39,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:39,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:39,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:39,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:39,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:39,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:39,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:39,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:39,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:39,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:39,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:39,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:39,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:39,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:39,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:39,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:39,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:39,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:39,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:39,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:39,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:39,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:39,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:39,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:39,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:39,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:39,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:39,477 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,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:39,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:39,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:39,497 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:39,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:39,498 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:39,498 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:39,498 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:39,498 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:39,499 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:39,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:39,500 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:39,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:39,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:39,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:39,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:39,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:39,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:39,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:39,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:39,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:39,503 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:39,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:39,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:39,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:39,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:39,504 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:39,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:39,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:39,504 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:39,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:39,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:39,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:39,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:39,567 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:39,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-09-20 13:26:39,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511cba30b/b56a33de06c6421c95a2355ff3a0cc01/FLAGefa77f749 [2019-09-20 13:26:40,078 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:40,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-09-20 13:26:40,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511cba30b/b56a33de06c6421c95a2355ff3a0cc01/FLAGefa77f749 [2019-09-20 13:26:40,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511cba30b/b56a33de06c6421c95a2355ff3a0cc01 [2019-09-20 13:26:40,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:40,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:40,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:40,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:40,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:40,429 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,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b30ac4 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,432 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,439 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:40,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:40,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:40,771 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:40,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:40,947 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:40,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40 WrapperNode [2019-09-20 13:26:40,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:40,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:40,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:40,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:40,958 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:40" (1/1) ... [2019-09-20 13:26:40,959 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:40" (1/1) ... [2019-09-20 13:26:40,967 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:40" (1/1) ... [2019-09-20 13:26:40,968 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:40" (1/1) ... [2019-09-20 13:26:40,980 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:40" (1/1) ... [2019-09-20 13:26:40,988 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:40" (1/1) ... [2019-09-20 13:26:40,991 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:40" (1/1) ... [2019-09-20 13:26:40,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:40,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:40,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:40,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:40,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (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,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:41,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-20 13:26:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:41,343 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,470 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-09-20 13:26:41,470 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-09-20 13:26:41,472 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,549 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-09-20 13:26:41,549 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-09-20 13:26:41,564 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,582 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:41,582 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:41,594 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,716 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-20 13:26:41,717 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-20 13:26:41,723 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:41,724 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:26:41,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:41 BoogieIcfgContainer [2019-09-20 13:26:41,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:41,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:41,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:41,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:41,730 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:41,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd3c510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:41, skipping insertion in model container [2019-09-20 13:26:41,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40" (2/3) ... [2019-09-20 13:26:41,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd3c510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:41, skipping insertion in model container [2019-09-20 13:26:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:41" (3/3) ... [2019-09-20 13:26:41,734 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-09-20 13:26:41,744 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:41,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:41,768 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:41,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:41,795 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:41,795 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:41,795 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:41,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:41,795 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:41,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:41,796 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-09-20 13:26:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:41,825 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:41,825 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:41,827 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:41,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-09-20 13:26:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:41,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:41,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,088 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,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,111 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2019-09-20 13:26:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,194 INFO L93 Difference]: Finished difference Result 152 states and 213 transitions. [2019-09-20 13:26:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,220 INFO L225 Difference]: With dead ends: 152 [2019-09-20 13:26:42,221 INFO L226 Difference]: Without dead ends: 140 [2019-09-20 13:26:42,224 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,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-20 13:26:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-20 13:26:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:26:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-09-20 13:26:42,298 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-09-20 13:26:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:42,299 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-09-20 13:26:42,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-09-20 13:26:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:42,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,301 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] [2019-09-20 13:26:42,301 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-09-20 13:26:42,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,495 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,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,499 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2019-09-20 13:26:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,647 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2019-09-20 13:26:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:42,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,654 INFO L225 Difference]: With dead ends: 203 [2019-09-20 13:26:42,654 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:26:42,655 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:26:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-09-20 13:26:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:26:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-09-20 13:26:42,674 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2019-09-20 13:26:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:42,675 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-09-20 13:26:42,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-09-20 13:26:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:42,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,676 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] [2019-09-20 13:26:42,677 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-09-20 13:26:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,789 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,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:42,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:42,791 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2019-09-20 13:26:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:42,871 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2019-09-20 13:26:42,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:42,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-20 13:26:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:42,877 INFO L225 Difference]: With dead ends: 248 [2019-09-20 13:26:42,878 INFO L226 Difference]: Without dead ends: 248 [2019-09-20 13:26:42,878 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-20 13:26:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2019-09-20 13:26:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-20 13:26:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-09-20 13:26:42,909 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2019-09-20 13:26:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:42,910 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-09-20 13:26:42,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-09-20 13:26:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:26:42,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,912 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] [2019-09-20 13:26:42,913 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-09-20 13:26:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,020 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,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:43,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:43,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:43,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:43,022 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2019-09-20 13:26:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,152 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2019-09-20 13:26:43,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:43,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-20 13:26:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,155 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:26:43,155 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:26:43,155 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:26:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-20 13:26:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-20 13:26:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2019-09-20 13:26:43,168 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2019-09-20 13:26:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,168 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2019-09-20 13:26:43,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2019-09-20 13:26:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:26:43,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,178 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:43,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-09-20 13:26:43,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,272 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,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:43,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:43,274 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2019-09-20 13:26:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,368 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2019-09-20 13:26:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:43,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-09-20 13:26:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,370 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:26:43,370 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:26:43,371 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:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:26:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2019-09-20 13:26:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:26:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2019-09-20 13:26:43,379 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2019-09-20 13:26:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,380 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2019-09-20 13:26:43,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2019-09-20 13:26:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:26:43,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,383 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] [2019-09-20 13:26:43,383 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-09-20 13:26:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,436 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,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,438 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2019-09-20 13:26:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,486 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2019-09-20 13:26:43,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-20 13:26:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,488 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:26:43,489 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:26:43,489 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:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:26:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-20 13:26:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-20 13:26:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2019-09-20 13:26:43,498 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2019-09-20 13:26:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,498 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2019-09-20 13:26:43,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2019-09-20 13:26:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:43,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,501 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] [2019-09-20 13:26:43,501 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-09-20 13:26:43,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,590 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,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,592 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2019-09-20 13:26:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,611 INFO L93 Difference]: Finished difference Result 178 states and 232 transitions. [2019-09-20 13:26:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 13:26:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,613 INFO L225 Difference]: With dead ends: 178 [2019-09-20 13:26:43,614 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 13:26:43,614 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:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 13:26:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-20 13:26:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 13:26:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-20 13:26:43,621 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-09-20 13:26:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,622 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-20 13:26:43,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-20 13:26:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:26:43,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,626 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] [2019-09-20 13:26:43,627 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-09-20 13:26:43,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,714 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,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:43,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:43,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:43,716 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-09-20 13:26:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,759 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-09-20 13:26:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:43,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-20 13:26:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,761 INFO L225 Difference]: With dead ends: 108 [2019-09-20 13:26:43,762 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:26:43,763 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:26:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-20 13:26:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:26:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-09-20 13:26:43,768 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-09-20 13:26:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,768 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-09-20 13:26:43,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-09-20 13:26:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:26:43,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,770 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] [2019-09-20 13:26:43,770 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-09-20 13:26:43,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,866 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,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:43,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:43,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:43,868 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2019-09-20 13:26:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,919 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2019-09-20 13:26:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:43,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-20 13:26:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,921 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:26:43,921 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:26:43,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:26:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-20 13:26:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-20 13:26:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-09-20 13:26:43,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2019-09-20 13:26:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,929 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-09-20 13:26:43,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-09-20 13:26:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:26:43,933 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,933 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] [2019-09-20 13:26:43,934 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-09-20 13:26:43,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,998 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,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,004 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2019-09-20 13:26:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,020 INFO L93 Difference]: Finished difference Result 180 states and 200 transitions. [2019-09-20 13:26:44,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-20 13:26:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,022 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:26:44,022 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:26:44,023 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:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:26:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2019-09-20 13:26:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 13:26:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2019-09-20 13:26:44,031 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2019-09-20 13:26:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,031 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2019-09-20 13:26:44,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2019-09-20 13:26:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:26:44,033 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,033 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] [2019-09-20 13:26:44,033 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-09-20 13:26:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,098 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,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:44,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,100 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2019-09-20 13:26:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,198 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-09-20 13:26:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:44,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-20 13:26:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,200 INFO L225 Difference]: With dead ends: 156 [2019-09-20 13:26:44,200 INFO L226 Difference]: Without dead ends: 152 [2019-09-20 13:26:44,200 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:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-20 13:26:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-20 13:26:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:26:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-20 13:26:44,206 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2019-09-20 13:26:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,207 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-20 13:26:44,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-20 13:26:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:26:44,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,208 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,208 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2019-09-20 13:26:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,251 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,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,253 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2019-09-20 13:26:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,264 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2019-09-20 13:26:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-20 13:26:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,266 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:26:44,266 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:26:44,266 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,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:26:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-09-20 13:26:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 13:26:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2019-09-20 13:26:44,272 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2019-09-20 13:26:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,272 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2019-09-20 13:26:44,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2019-09-20 13:26:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:26:44,273 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,274 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,274 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2019-09-20 13:26:44,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,318 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2019-09-20 13:26:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,351 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2019-09-20 13:26:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-20 13:26:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,353 INFO L225 Difference]: With dead ends: 175 [2019-09-20 13:26:44,353 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:26:44,353 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,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:26:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-09-20 13:26:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-20 13:26:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2019-09-20 13:26:44,360 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2019-09-20 13:26:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,361 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2019-09-20 13:26:44,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2019-09-20 13:26:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:26:44,362 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,362 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,362 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2019-09-20 13:26:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,439 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,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:26:44,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:26:44,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:26:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:44,442 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2019-09-20 13:26:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,499 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-09-20 13:26:44,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:44,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-20 13:26:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,501 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:26:44,501 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:26:44,502 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:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:26:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-20 13:26:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-20 13:26:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-09-20 13:26:44,510 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2019-09-20 13:26:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,510 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-09-20 13:26:44,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:26:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-09-20 13:26:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:26:44,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,511 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] [2019-09-20 13:26:44,512 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2019-09-20 13:26:44,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,738 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,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:26:44,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:26:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:26:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:44,740 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 11 states. [2019-09-20 13:26:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,986 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2019-09-20 13:26:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:44,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-09-20 13:26:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,988 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:26:44,988 INFO L226 Difference]: Without dead ends: 151 [2019-09-20 13:26:44,989 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:26:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-20 13:26:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-20 13:26:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:26:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-09-20 13:26:44,998 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2019-09-20 13:26:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,998 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-09-20 13:26:44,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:26:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-09-20 13:26:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:26:44,999 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,999 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] [2019-09-20 13:26:45,000 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-09-20 13:26:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,114 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,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:45,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:45,117 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2019-09-20 13:26:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,225 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-09-20 13:26:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:45,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:26:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,226 INFO L225 Difference]: With dead ends: 135 [2019-09-20 13:26:45,226 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 13:26:45,227 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:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 13:26:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-20 13:26:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-20 13:26:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-09-20 13:26:45,244 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-09-20 13:26:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,244 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-09-20 13:26:45,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-09-20 13:26:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:26:45,245 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,245 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] [2019-09-20 13:26:45,245 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-09-20 13:26:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,335 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,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:45,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:45,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:45,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:45,337 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2019-09-20 13:26:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,364 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-09-20 13:26:45,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:45,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-20 13:26:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,366 INFO L225 Difference]: With dead ends: 133 [2019-09-20 13:26:45,366 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 13:26:45,367 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:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 13:26:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-20 13:26:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-20 13:26:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-09-20 13:26:45,373 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-09-20 13:26:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,374 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-09-20 13:26:45,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-09-20 13:26:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:26:45,375 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,376 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] [2019-09-20 13:26:45,376 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-09-20 13:26:45,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,452 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,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:45,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:45,455 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2019-09-20 13:26:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,549 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2019-09-20 13:26:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:45,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-20 13:26:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,550 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:26:45,550 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:45,550 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:45,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-09-20 13:26:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,551 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:45,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:45,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:45,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:45 BoogieIcfgContainer [2019-09-20 13:26:45,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:45,561 INFO L168 Benchmark]: Toolchain (without parser) took 5137.22 ms. Allocated memory was 135.3 MB in the beginning and 298.8 MB in the end (delta: 163.6 MB). Free memory was 90.3 MB in the beginning and 202.7 MB in the end (delta: -112.4 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:45,563 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 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:45,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.91 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 90.1 MB in the beginning and 175.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:45,569 INFO L168 Benchmark]: Boogie Preprocessor took 47.32 ms. Allocated memory is still 201.9 MB. Free memory was 175.8 MB in the beginning and 173.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:45,569 INFO L168 Benchmark]: RCFGBuilder took 729.61 ms. Allocated memory is still 201.9 MB. Free memory was 172.8 MB in the beginning and 127.9 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:45,571 INFO L168 Benchmark]: TraceAbstraction took 3831.05 ms. Allocated memory was 201.9 MB in the beginning and 298.8 MB in the end (delta: 97.0 MB). Free memory was 127.9 MB in the beginning and 202.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:45,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 524.91 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 90.1 MB in the beginning and 175.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.32 ms. Allocated memory is still 201.9 MB. Free memory was 175.8 MB in the beginning and 173.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.61 ms. Allocated memory is still 201.9 MB. Free memory was 172.8 MB in the beginning and 127.9 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3831.05 ms. Allocated memory was 201.9 MB in the beginning and 298.8 MB in the end (delta: 97.0 MB). Free memory was 127.9 MB in the beginning and 202.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: 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 13 procedures, 151 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2242 SDtfs, 1327 SDslu, 2975 SDs, 0 SdLazy, 661 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred 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, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 94387 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...