/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:23:43,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:23:43,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:23:43,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:23:43,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:23:43,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:23:43,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:23:43,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:23:43,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:23:43,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:23:43,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:23:43,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:23:43,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:23:43,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:23:43,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:23:43,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:23:43,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:23:43,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:23:43,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:23:43,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:23:43,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:23:43,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:23:43,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:23:43,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:23:43,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:23:43,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:23:43,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:23:43,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:23:43,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:23:43,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:23:43,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:23:43,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:23:43,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:23:43,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:23:43,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:23:43,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:23:43,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:23:43,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:23:43,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:23:43,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:23:43,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:23:43,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:23:43,407 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:23:43,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:23:43,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:23:43,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:23:43,409 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:23:43,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:23:43,410 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:23:43,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:23:43,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:23:43,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:23:43,411 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:23:43,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:23:43,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:23:43,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:23:43,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:23:43,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:23:43,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:23:43,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:23:43,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:23:43,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:23:43,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:23:43,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:23:43,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:23:43,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:23:43,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:23:43,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:23:43,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:23:43,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:23:43,923 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:23:43,923 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:23:43,925 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-09-04 13:23:44,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0858f61c/af722b84e80b45469b4abe9390b95299/FLAG6dee0d350 [2020-09-04 13:23:44,666 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:23:44,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-09-04 13:23:44,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0858f61c/af722b84e80b45469b4abe9390b95299/FLAG6dee0d350 [2020-09-04 13:23:44,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0858f61c/af722b84e80b45469b4abe9390b95299 [2020-09-04 13:23:44,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:23:44,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:23:44,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:23:44,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:23:44,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:23:45,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:44" (1/1) ... [2020-09-04 13:23:45,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5360a5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45, skipping insertion in model container [2020-09-04 13:23:45,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:44" (1/1) ... [2020-09-04 13:23:45,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:23:45,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:23:45,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:23:45,414 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:23:45,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:23:45,627 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:23:45,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45 WrapperNode [2020-09-04 13:23:45,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:23:45,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:23:45,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:23:45,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:23:45,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... [2020-09-04 13:23:45,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:23:45,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:23:45,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:23:45,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:23:45,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:23:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:23:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:23:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-09-04 13:23:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-09-04 13:23:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-09-04 13:23:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:23:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-09-04 13:23:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-09-04 13:23:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-09-04 13:23:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-09-04 13:23:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-09-04 13:23:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-09-04 13:23:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-09-04 13:23:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:23:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 13:23:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:23:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-09-04 13:23:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-09-04 13:23:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-09-04 13:23:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-09-04 13:23:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-09-04 13:23:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-09-04 13:23:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-09-04 13:23:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-09-04 13:23:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-09-04 13:23:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-09-04 13:23:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:23:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-09-04 13:23:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:23:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:23:46,066 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-04 13:23:46,176 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-09-04 13:23:46,176 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-09-04 13:23:46,179 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-04 13:23:46,267 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-09-04 13:23:46,267 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-09-04 13:23:46,282 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-04 13:23:46,310 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-09-04 13:23:46,311 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-09-04 13:23:46,329 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-09-04 13:23:46,502 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-09-04 13:23:46,502 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-09-04 13:23:46,522 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:23:46,522 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:23:46,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:46 BoogieIcfgContainer [2020-09-04 13:23:46,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:23:46,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:23:46,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:23:46,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:23:46,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:23:44" (1/3) ... [2020-09-04 13:23:46,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a03847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:46, skipping insertion in model container [2020-09-04 13:23:46,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:45" (2/3) ... [2020-09-04 13:23:46,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a03847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:46, skipping insertion in model container [2020-09-04 13:23:46,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:46" (3/3) ... [2020-09-04 13:23:46,542 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-09-04 13:23:46,555 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:23:46,567 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:23:46,592 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:23:46,624 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:23:46,625 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:23:46,625 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:23:46,625 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:23:46,625 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:23:46,625 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:23:46,625 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:23:46,626 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:23:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-09-04 13:23:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:23:46,666 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:46,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:23:46,669 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:46,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:46,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-09-04 13:23:46,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:46,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761983681] [2020-09-04 13:23:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:47,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:47,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:47,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761983681] [2020-09-04 13:23:47,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:47,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:23:47,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830805166] [2020-09-04 13:23:47,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:23:47,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:23:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:23:47,240 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-09-04 13:23:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:48,075 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-09-04 13:23:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:23:48,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-09-04 13:23:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:48,114 INFO L225 Difference]: With dead ends: 303 [2020-09-04 13:23:48,115 INFO L226 Difference]: Without dead ends: 157 [2020-09-04 13:23:48,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:23:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-09-04 13:23:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-09-04 13:23:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-04 13:23:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-09-04 13:23:48,232 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-09-04 13:23:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:48,233 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-09-04 13:23:48,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:23:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-09-04 13:23:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:23:48,234 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:48,234 INFO L422 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] [2020-09-04 13:23:48,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:23:48,235 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:48,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-09-04 13:23:48,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:48,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702655431] [2020-09-04 13:23:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:48,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:48,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:48,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:48,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702655431] [2020-09-04 13:23:48,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:48,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:23:48,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908365429] [2020-09-04 13:23:48,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:23:48,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:23:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:23:48,614 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-09-04 13:23:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:49,525 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-09-04 13:23:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:23:49,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-09-04 13:23:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:49,530 INFO L225 Difference]: With dead ends: 275 [2020-09-04 13:23:49,530 INFO L226 Difference]: Without dead ends: 219 [2020-09-04 13:23:49,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:23:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-09-04 13:23:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-09-04 13:23:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-09-04 13:23:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-09-04 13:23:49,571 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-09-04 13:23:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:49,572 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-09-04 13:23:49,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:23:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-09-04 13:23:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:23:49,573 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:49,577 INFO L422 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] [2020-09-04 13:23:49,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:23:49,577 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-09-04 13:23:49,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:49,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32514806] [2020-09-04 13:23:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:49,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:49,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:49,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:49,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32514806] [2020-09-04 13:23:49,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:49,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:23:49,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306768010] [2020-09-04 13:23:49,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:23:49,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:23:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:23:49,893 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-09-04 13:23:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:50,344 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-09-04 13:23:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:23:50,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 13:23:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:50,349 INFO L225 Difference]: With dead ends: 316 [2020-09-04 13:23:50,349 INFO L226 Difference]: Without dead ends: 254 [2020-09-04 13:23:50,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:23:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-09-04 13:23:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-09-04 13:23:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-09-04 13:23:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-09-04 13:23:50,398 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-09-04 13:23:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:50,399 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-09-04 13:23:50,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:23:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-09-04 13:23:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 13:23:50,401 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:50,401 INFO L422 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] [2020-09-04 13:23:50,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:23:50,402 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-09-04 13:23:50,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:50,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348103667] [2020-09-04 13:23:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:50,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:50,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:50,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:50,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348103667] [2020-09-04 13:23:50,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:50,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:23:50,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215012697] [2020-09-04 13:23:50,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:23:50,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:23:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:23:50,604 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-09-04 13:23:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:51,190 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-09-04 13:23:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:23:51,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-09-04 13:23:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:51,193 INFO L225 Difference]: With dead ends: 220 [2020-09-04 13:23:51,193 INFO L226 Difference]: Without dead ends: 217 [2020-09-04 13:23:51,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:23:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-09-04 13:23:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-09-04 13:23:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-09-04 13:23:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-09-04 13:23:51,218 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-09-04 13:23:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:51,219 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-09-04 13:23:51,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:23:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-09-04 13:23:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 13:23:51,221 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:51,222 INFO L422 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] [2020-09-04 13:23:51,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:23:51,222 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-09-04 13:23:51,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:51,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009221365] [2020-09-04 13:23:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:51,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:51,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:51,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:51,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:51,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009221365] [2020-09-04 13:23:51,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:51,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:23:51,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784234631] [2020-09-04 13:23:51,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:23:51,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:23:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:23:51,471 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-09-04 13:23:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:52,264 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-09-04 13:23:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:23:52,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 13:23:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:52,268 INFO L225 Difference]: With dead ends: 274 [2020-09-04 13:23:52,268 INFO L226 Difference]: Without dead ends: 208 [2020-09-04 13:23:52,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:23:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-09-04 13:23:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-09-04 13:23:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-09-04 13:23:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-09-04 13:23:52,287 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-09-04 13:23:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:52,288 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-09-04 13:23:52,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:23:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-09-04 13:23:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 13:23:52,291 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:52,291 INFO L422 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] [2020-09-04 13:23:52,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:23:52,291 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-09-04 13:23:52,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:52,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752037139] [2020-09-04 13:23:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:23:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:23:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:52,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752037139] [2020-09-04 13:23:52,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:52,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:23:52,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350306051] [2020-09-04 13:23:52,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:23:52,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:23:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:23:52,539 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-09-04 13:23:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:53,051 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-09-04 13:23:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:23:53,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 13:23:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:53,054 INFO L225 Difference]: With dead ends: 258 [2020-09-04 13:23:53,054 INFO L226 Difference]: Without dead ends: 197 [2020-09-04 13:23:53,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:23:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-09-04 13:23:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-09-04 13:23:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-04 13:23:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-09-04 13:23:53,074 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-09-04 13:23:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:53,074 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-09-04 13:23:53,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:23:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-09-04 13:23:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 13:23:53,077 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:53,077 INFO L422 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] [2020-09-04 13:23:53,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:23:53,078 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:53,078 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-09-04 13:23:53,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:53,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78919437] [2020-09-04 13:23:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:23:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:53,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78919437] [2020-09-04 13:23:53,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:53,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:23:53,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142159816] [2020-09-04 13:23:53,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:23:53,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:23:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:23:53,350 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-09-04 13:23:54,112 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-09-04 13:23:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:54,379 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-09-04 13:23:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:23:54,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-09-04 13:23:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:54,383 INFO L225 Difference]: With dead ends: 243 [2020-09-04 13:23:54,384 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 13:23:54,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:23:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 13:23:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-09-04 13:23:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-09-04 13:23:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-09-04 13:23:54,405 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-09-04 13:23:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:54,406 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-09-04 13:23:54,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:23:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-09-04 13:23:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 13:23:54,408 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:54,408 INFO L422 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] [2020-09-04 13:23:54,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:23:54,409 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-09-04 13:23:54,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:54,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156926081] [2020-09-04 13:23:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:23:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:54,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156926081] [2020-09-04 13:23:54,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:54,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:23:54,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298249211] [2020-09-04 13:23:54,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:23:54,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:23:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:23:54,762 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-09-04 13:23:54,992 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-09-04 13:23:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:56,342 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-09-04 13:23:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:23:56,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-09-04 13:23:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:56,346 INFO L225 Difference]: With dead ends: 246 [2020-09-04 13:23:56,346 INFO L226 Difference]: Without dead ends: 222 [2020-09-04 13:23:56,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-09-04 13:23:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-09-04 13:23:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-09-04 13:23:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-09-04 13:23:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-09-04 13:23:56,367 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-09-04 13:23:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:56,368 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-09-04 13:23:56,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:23:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-09-04 13:23:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 13:23:56,369 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:56,370 INFO L422 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] [2020-09-04 13:23:56,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:23:56,370 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-09-04 13:23:56,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:56,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681390584] [2020-09-04 13:23:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:23:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:56,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681390584] [2020-09-04 13:23:56,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:56,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:23:56,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886731531] [2020-09-04 13:23:56,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:23:56,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:23:56,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:23:56,632 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-09-04 13:23:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:56,910 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-09-04 13:23:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:23:56,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 13:23:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:56,917 INFO L225 Difference]: With dead ends: 203 [2020-09-04 13:23:56,917 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 13:23:56,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:23:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 13:23:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-04 13:23:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-04 13:23:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-09-04 13:23:56,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-09-04 13:23:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:56,937 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-09-04 13:23:56,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:23:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-09-04 13:23:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-04 13:23:56,938 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:56,939 INFO L422 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] [2020-09-04 13:23:56,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:23:56,939 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-09-04 13:23:56,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:56,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446330090] [2020-09-04 13:23:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:57,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446330090] [2020-09-04 13:23:57,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:57,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:23:57,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531354366] [2020-09-04 13:23:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:23:57,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:23:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:23:57,266 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-09-04 13:23:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:57,791 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-09-04 13:23:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:23:57,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-09-04 13:23:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:57,794 INFO L225 Difference]: With dead ends: 119 [2020-09-04 13:23:57,794 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 13:23:57,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:23:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 13:23:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-04 13:23:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-04 13:23:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-09-04 13:23:57,807 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-09-04 13:23:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:57,808 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-09-04 13:23:57,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:23:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-09-04 13:23:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 13:23:57,809 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:57,810 INFO L422 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] [2020-09-04 13:23:57,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:23:57,810 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-09-04 13:23:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:57,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904365460] [2020-09-04 13:23:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:57,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:58,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904365460] [2020-09-04 13:23:58,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:58,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:23:58,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157025528] [2020-09-04 13:23:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:23:58,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:23:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:23:58,068 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-09-04 13:23:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:58,292 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-09-04 13:23:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:23:58,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 13:23:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:58,295 INFO L225 Difference]: With dead ends: 122 [2020-09-04 13:23:58,295 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 13:23:58,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:23:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 13:23:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-04 13:23:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 13:23:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-09-04 13:23:58,309 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-09-04 13:23:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:58,309 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-09-04 13:23:58,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:23:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-09-04 13:23:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 13:23:58,311 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:58,311 INFO L422 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] [2020-09-04 13:23:58,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:23:58,312 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-09-04 13:23:58,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:58,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584442677] [2020-09-04 13:23:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:58,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584442677] [2020-09-04 13:23:58,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:58,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:23:58,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49185662] [2020-09-04 13:23:58,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:23:58,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:23:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:23:58,668 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-09-04 13:23:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:59,048 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-09-04 13:23:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:23:59,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-09-04 13:23:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:59,050 INFO L225 Difference]: With dead ends: 112 [2020-09-04 13:23:59,050 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 13:23:59,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:23:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 13:23:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-09-04 13:23:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-09-04 13:23:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-09-04 13:23:59,064 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-09-04 13:23:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:59,065 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-09-04 13:23:59,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:23:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-09-04 13:23:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 13:23:59,066 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:59,067 INFO L422 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] [2020-09-04 13:23:59,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:23:59,067 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-09-04 13:23:59,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:59,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567543949] [2020-09-04 13:23:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:59,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567543949] [2020-09-04 13:23:59,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:59,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:23:59,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024934672] [2020-09-04 13:23:59,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:23:59,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:23:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:23:59,319 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-09-04 13:23:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:59,564 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-09-04 13:23:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:23:59,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-09-04 13:23:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:59,567 INFO L225 Difference]: With dead ends: 105 [2020-09-04 13:23:59,568 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 13:23:59,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:23:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 13:23:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-09-04 13:23:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-04 13:23:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-09-04 13:23:59,589 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-09-04 13:23:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:59,590 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-09-04 13:23:59,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:23:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-09-04 13:23:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 13:23:59,591 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:59,592 INFO L422 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] [2020-09-04 13:23:59,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:23:59,592 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-09-04 13:23:59,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:59,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524504921] [2020-09-04 13:23:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:23:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:23:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:23:59,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524504921] [2020-09-04 13:23:59,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:59,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:23:59,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316035883] [2020-09-04 13:23:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:23:59,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:59,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:23:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:23:59,943 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-09-04 13:24:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:00,361 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-09-04 13:24:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:24:00,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-09-04 13:24:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:00,364 INFO L225 Difference]: With dead ends: 98 [2020-09-04 13:24:00,364 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 13:24:00,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:24:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 13:24:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-09-04 13:24:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-04 13:24:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-09-04 13:24:00,382 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-09-04 13:24:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:00,384 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-09-04 13:24:00,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:24:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-09-04 13:24:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 13:24:00,385 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:00,385 INFO L422 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] [2020-09-04 13:24:00,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:24:00,386 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-09-04 13:24:00,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:00,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386081160] [2020-09-04 13:24:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:24:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:24:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:24:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:24:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:00,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386081160] [2020-09-04 13:24:00,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:00,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:24:00,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206972343] [2020-09-04 13:24:00,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:24:00,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:00,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:24:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:24:00,771 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-09-04 13:24:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:01,116 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-09-04 13:24:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:24:01,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 13:24:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:01,118 INFO L225 Difference]: With dead ends: 107 [2020-09-04 13:24:01,119 INFO L226 Difference]: Without dead ends: 76 [2020-09-04 13:24:01,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:24:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-04 13:24:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-09-04 13:24:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:24:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-09-04 13:24:01,131 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-09-04 13:24:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:01,131 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-09-04 13:24:01,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:24:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-09-04 13:24:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 13:24:01,133 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:01,133 INFO L422 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] [2020-09-04 13:24:01,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:24:01,133 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-09-04 13:24:01,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:01,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609184302] [2020-09-04 13:24:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:24:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:24:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:24:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:24:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:01,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609184302] [2020-09-04 13:24:01,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:01,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:24:01,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639269447] [2020-09-04 13:24:01,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:24:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:24:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:24:01,379 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-09-04 13:24:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:01,681 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-09-04 13:24:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:24:01,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-09-04 13:24:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:01,684 INFO L225 Difference]: With dead ends: 141 [2020-09-04 13:24:01,684 INFO L226 Difference]: Without dead ends: 134 [2020-09-04 13:24:01,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:24:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-04 13:24:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-09-04 13:24:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 13:24:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-09-04 13:24:01,702 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-09-04 13:24:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:01,703 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-09-04 13:24:01,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:24:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-09-04 13:24:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 13:24:01,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:01,704 INFO L422 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] [2020-09-04 13:24:01,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:24:01,705 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-09-04 13:24:01,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:01,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345507884] [2020-09-04 13:24:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:24:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:01,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:24:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:24:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:24:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:02,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345507884] [2020-09-04 13:24:02,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:02,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:24:02,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790599383] [2020-09-04 13:24:02,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:24:02,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:02,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:24:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:24:02,079 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-09-04 13:24:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:02,391 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-09-04 13:24:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:24:02,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-09-04 13:24:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:02,394 INFO L225 Difference]: With dead ends: 144 [2020-09-04 13:24:02,394 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 13:24:02,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:24:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 13:24:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-09-04 13:24:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 13:24:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-09-04 13:24:02,416 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-09-04 13:24:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:02,416 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-09-04 13:24:02,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:24:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-09-04 13:24:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-04 13:24:02,418 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:02,419 INFO L422 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] [2020-09-04 13:24:02,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:24:02,419 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-09-04 13:24:02,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:02,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29304535] [2020-09-04 13:24:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:24:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:24:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:24:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:24:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:24:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 13:24:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:02,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29304535] [2020-09-04 13:24:02,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:02,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:24:02,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959455387] [2020-09-04 13:24:02,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:24:02,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:24:02,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:24:02,722 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-09-04 13:24:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:02,926 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-09-04 13:24:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:24:02,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-09-04 13:24:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:02,927 INFO L225 Difference]: With dead ends: 133 [2020-09-04 13:24:02,928 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:24:02,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:24:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:24:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:24:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:24:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:24:02,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-09-04 13:24:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:02,930 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:24:02,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:24:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:24:02,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:24:02,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:24:02,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:24:03,474 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-09-04 13:24:06,078 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 13:24:06,288 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-09-04 13:24:06,712 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-09-04 13:24:06,848 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2020-09-04 13:24:07,155 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-09-04 13:24:07,391 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-09-04 13:24:07,738 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-09-04 13:24:08,045 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-04 13:24:08,402 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-09-04 13:24:08,855 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-09-04 13:24:09,094 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-09-04 13:24:09,392 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-09-04 13:24:09,630 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-09-04 13:24:09,816 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-04 13:24:10,324 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-09-04 13:24:10,591 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-09-04 13:24:10,761 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-04 13:24:10,965 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-09-04 13:24:11,122 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-09-04 13:24:11,412 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-09-04 13:24:11,633 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-04 13:24:11,758 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 13:24:11,966 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-09-04 13:24:12,280 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-09-04 13:24:12,471 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-09-04 13:24:12,640 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-09-04 13:24:12,929 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-09-04 13:24:12,993 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-09-04 13:24:12,994 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-09-04 13:24:12,994 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-09-04 13:24:12,994 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-09-04 13:24:12,994 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-09-04 13:24:12,995 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-09-04 13:24:12,995 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-09-04 13:24:12,995 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-09-04 13:24:12,995 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-09-04 13:24:12,995 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,996 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-09-04 13:24:12,996 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-09-04 13:24:12,996 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,996 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-09-04 13:24:12,997 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-09-04 13:24:12,997 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-09-04 13:24:12,997 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-09-04 13:24:12,997 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-09-04 13:24:12,997 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,997 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-09-04 13:24:12,997 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-09-04 13:24:12,998 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-09-04 13:24:12,999 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-09-04 13:24:12,999 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:12,999 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-09-04 13:24:12,999 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,000 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-09-04 13:24:13,000 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,000 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-09-04 13:24:13,000 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,000 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-09-04 13:24:13,000 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-09-04 13:24:13,001 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,001 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-09-04 13:24:13,001 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-09-04 13:24:13,001 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-09-04 13:24:13,001 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,001 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-09-04 13:24:13,002 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-09-04 13:24:13,002 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-09-04 13:24:13,002 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-09-04 13:24:13,002 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-09-04 13:24:13,002 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-09-04 13:24:13,003 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-09-04 13:24:13,003 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-09-04 13:24:13,003 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-09-04 13:24:13,003 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-09-04 13:24:13,003 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-09-04 13:24:13,003 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-09-04 13:24:13,004 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-09-04 13:24:13,004 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-09-04 13:24:13,004 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-09-04 13:24:13,004 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-09-04 13:24:13,004 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-09-04 13:24:13,005 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-09-04 13:24:13,005 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-09-04 13:24:13,005 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-09-04 13:24:13,005 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-09-04 13:24:13,005 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,006 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-09-04 13:24:13,006 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,006 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-09-04 13:24:13,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:24:13,006 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-09-04 13:24:13,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:24:13,007 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-09-04 13:24:13,007 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-09-04 13:24:13,007 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-09-04 13:24:13,007 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-09-04 13:24:13,007 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-09-04 13:24:13,007 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-09-04 13:24:13,008 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-09-04 13:24:13,008 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-09-04 13:24:13,008 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-09-04 13:24:13,008 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-09-04 13:24:13,009 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-09-04 13:24:13,009 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-09-04 13:24:13,009 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-09-04 13:24:13,009 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-09-04 13:24:13,009 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-09-04 13:24:13,010 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-09-04 13:24:13,010 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-09-04 13:24:13,010 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:24:13,010 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-09-04 13:24:13,010 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:24:13,010 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:24:13,011 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-09-04 13:24:13,011 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-09-04 13:24:13,011 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-09-04 13:24:13,011 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-09-04 13:24:13,011 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,011 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,012 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,012 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-09-04 13:24:13,012 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-09-04 13:24:13,012 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-09-04 13:24:13,012 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,012 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-09-04 13:24:13,013 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-09-04 13:24:13,014 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-09-04 13:24:13,014 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,014 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-09-04 13:24:13,014 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-09-04 13:24:13,014 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,015 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,015 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-09-04 13:24:13,015 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,015 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-09-04 13:24:13,015 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-09-04 13:24:13,015 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-09-04 13:24:13,015 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-09-04 13:24:13,016 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,016 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-09-04 13:24:13,016 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-09-04 13:24:13,016 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-09-04 13:24:13,016 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-09-04 13:24:13,016 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,016 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-09-04 13:24:13,017 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-09-04 13:24:13,018 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-09-04 13:24:13,018 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-09-04 13:24:13,018 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-09-04 13:24:13,018 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-09-04 13:24:13,018 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,018 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-09-04 13:24:13,019 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,019 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-09-04 13:24:13,019 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-09-04 13:24:13,019 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-09-04 13:24:13,019 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-09-04 13:24:13,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:24:13 BoogieIcfgContainer [2020-09-04 13:24:13,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:24:13,066 INFO L168 Benchmark]: Toolchain (without parser) took 28077.89 ms. Allocated memory was 139.5 MB in the beginning and 514.3 MB in the end (delta: 374.9 MB). Free memory was 102.5 MB in the beginning and 437.7 MB in the end (delta: -335.1 MB). Peak memory consumption was 363.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:24:13,067 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:24:13,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.66 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 179.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:24:13,068 INFO L168 Benchmark]: Boogie Preprocessor took 58.08 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 176.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:24:13,069 INFO L168 Benchmark]: RCFGBuilder took 843.12 ms. Allocated memory is still 202.9 MB. Free memory was 176.0 MB in the beginning and 130.9 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:24:13,069 INFO L168 Benchmark]: TraceAbstraction took 26532.59 ms. Allocated memory was 202.9 MB in the beginning and 514.3 MB in the end (delta: 311.4 MB). Free memory was 130.3 MB in the beginning and 437.7 MB in the end (delta: -307.4 MB). Peak memory consumption was 328.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:24:13,072 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 634.66 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 179.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.08 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 176.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.12 ms. Allocated memory is still 202.9 MB. Free memory was 176.0 MB in the beginning and 130.9 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26532.59 ms. Allocated memory was 202.9 MB in the beginning and 514.3 MB in the end (delta: 311.4 MB). Free memory was 130.3 MB in the beginning and 437.7 MB in the end (delta: -307.4 MB). Peak memory consumption was 328.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: 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 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...