/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-72570d3 [2020-08-22 16:37:19,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 16:37:19,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 16:37:19,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 16:37:19,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 16:37:19,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 16:37:19,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 16:37:19,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 16:37:19,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 16:37:19,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 16:37:19,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 16:37:19,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 16:37:19,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 16:37:19,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 16:37:19,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 16:37:19,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 16:37:19,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 16:37:19,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 16:37:19,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 16:37:19,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 16:37:19,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 16:37:19,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 16:37:19,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 16:37:19,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 16:37:19,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 16:37:19,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 16:37:19,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 16:37:19,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 16:37:19,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 16:37:19,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 16:37:19,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 16:37:19,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 16:37:19,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 16:37:19,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 16:37:19,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 16:37:19,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 16:37:19,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 16:37:19,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 16:37:19,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 16:37:19,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 16:37:19,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 16:37:19,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 16:37:19,999 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 16:37:19,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 16:37:20,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 16:37:20,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 16:37:20,001 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 16:37:20,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 16:37:20,001 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 16:37:20,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 16:37:20,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 16:37:20,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 16:37:20,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 16:37:20,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 16:37:20,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 16:37:20,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 16:37:20,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 16:37:20,003 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 16:37:20,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 16:37:20,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 16:37:20,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 16:37:20,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 16:37:20,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 16:37:20,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:37:20,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 16:37:20,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 16:37:20,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 16:37:20,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 16:37:20,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 16:37:20,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 16:37:20,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 16:37:20,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 16:37:20,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 16:37:20,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 16:37:20,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 16:37:20,341 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 16:37:20,342 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 16:37:20,343 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-22 16:37:20,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17059fb0c/24823ec5086e4c998622d01851cef316/FLAG284db0407 [2020-08-22 16:37:20,928 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 16:37:20,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-22 16:37:20,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17059fb0c/24823ec5086e4c998622d01851cef316/FLAG284db0407 [2020-08-22 16:37:21,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17059fb0c/24823ec5086e4c998622d01851cef316 [2020-08-22 16:37:21,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 16:37:21,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 16:37:21,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 16:37:21,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 16:37:21,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 16:37:21,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfd720f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21, skipping insertion in model container [2020-08-22 16:37:21,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 16:37:21,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 16:37:21,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:37:21,528 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 16:37:21,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:37:21,718 INFO L208 MainTranslator]: Completed translation [2020-08-22 16:37:21,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21 WrapperNode [2020-08-22 16:37:21,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 16:37:21,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 16:37:21,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 16:37:21,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 16:37:21,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... [2020-08-22 16:37:21,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 16:37:21,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 16:37:21,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 16:37:21,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 16:37:21,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:37:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 16:37:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-22 16:37:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-22 16:37:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-22 16:37:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-22 16:37:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-22 16:37:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-22 16:37:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-22 16:37:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-22 16:37:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-22 16:37:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-22 16:37:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 16:37:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-22 16:37:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 16:37:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 16:37:22,104 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-22 16:37:22,227 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-22 16:37:22,228 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-22 16:37:22,230 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-22 16:37:22,278 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-22 16:37:22,278 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-22 16:37:22,296 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-22 16:37:22,339 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-22 16:37:22,340 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-22 16:37:22,357 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-22 16:37:22,587 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-22 16:37:22,587 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-22 16:37:22,603 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 16:37:22,603 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 16:37:22,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:37:22 BoogieIcfgContainer [2020-08-22 16:37:22,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 16:37:22,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 16:37:22,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 16:37:22,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 16:37:22,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 04:37:21" (1/3) ... [2020-08-22 16:37:22,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec4964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:37:22, skipping insertion in model container [2020-08-22 16:37:22,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:37:21" (2/3) ... [2020-08-22 16:37:22,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec4964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:37:22, skipping insertion in model container [2020-08-22 16:37:22,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:37:22" (3/3) ... [2020-08-22 16:37:22,619 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-22 16:37:22,628 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 16:37:22,635 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 16:37:22,648 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 16:37:22,677 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 16:37:22,677 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 16:37:22,678 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 16:37:22,678 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 16:37:22,678 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 16:37:22,678 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 16:37:22,678 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 16:37:22,678 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 16:37:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-22 16:37:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-22 16:37:22,708 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:22,709 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-08-22 16:37:22,710 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-22 16:37:22,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:22,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711606324] [2020-08-22 16:37:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:23,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:23,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:23,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711606324] [2020-08-22 16:37:23,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:23,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:37:23,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496991703] [2020-08-22 16:37:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:37:23,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:37:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:37:23,177 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-22 16:37:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:23,877 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-22 16:37:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-22 16:37:23,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-22 16:37:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:23,896 INFO L225 Difference]: With dead ends: 303 [2020-08-22 16:37:23,896 INFO L226 Difference]: Without dead ends: 157 [2020-08-22 16:37:23,903 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-08-22 16:37:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-22 16:37:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-22 16:37:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-22 16:37:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-22 16:37:23,982 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-22 16:37:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:23,983 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-22 16:37:23,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:37:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-22 16:37:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 16:37:23,985 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:23,985 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-08-22 16:37:23,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 16:37:23,986 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-22 16:37:23,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:23,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053877512] [2020-08-22 16:37:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:24,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:24,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:24,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:24,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053877512] [2020-08-22 16:37:24,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:24,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 16:37:24,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167354047] [2020-08-22 16:37:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 16:37:24,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 16:37:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-22 16:37:24,286 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-22 16:37:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:25,129 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-22 16:37:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:37:25,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 16:37:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:25,136 INFO L225 Difference]: With dead ends: 275 [2020-08-22 16:37:25,137 INFO L226 Difference]: Without dead ends: 219 [2020-08-22 16:37:25,139 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-08-22 16:37:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-22 16:37:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-22 16:37:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-22 16:37:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-22 16:37:25,176 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-22 16:37:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:25,177 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-22 16:37:25,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 16:37:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-22 16:37:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 16:37:25,178 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:25,178 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-08-22 16:37:25,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 16:37:25,179 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:25,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:25,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-22 16:37:25,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:25,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596099156] [2020-08-22 16:37:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:25,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596099156] [2020-08-22 16:37:25,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:25,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 16:37:25,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84862694] [2020-08-22 16:37:25,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 16:37:25,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:25,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 16:37:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-22 16:37:25,381 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-22 16:37:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:25,781 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-22 16:37:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:37:25,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 16:37:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:25,784 INFO L225 Difference]: With dead ends: 316 [2020-08-22 16:37:25,785 INFO L226 Difference]: Without dead ends: 254 [2020-08-22 16:37:25,789 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-08-22 16:37:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-22 16:37:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-22 16:37:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-22 16:37:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-22 16:37:25,833 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-22 16:37:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:25,834 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-22 16:37:25,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 16:37:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-22 16:37:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-22 16:37:25,836 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:25,836 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-08-22 16:37:25,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 16:37:25,837 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-22 16:37:25,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:25,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943338979] [2020-08-22 16:37:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:25,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:26,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943338979] [2020-08-22 16:37:26,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:26,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 16:37:26,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692961330] [2020-08-22 16:37:26,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 16:37:26,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 16:37:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-22 16:37:26,035 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-22 16:37:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:26,634 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-22 16:37:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:37:26,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-22 16:37:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:26,643 INFO L225 Difference]: With dead ends: 220 [2020-08-22 16:37:26,643 INFO L226 Difference]: Without dead ends: 217 [2020-08-22 16:37:26,646 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-08-22 16:37:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-22 16:37:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-22 16:37:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-22 16:37:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-22 16:37:26,697 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-22 16:37:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:26,698 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-22 16:37:26,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 16:37:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-22 16:37:26,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-22 16:37:26,711 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:26,711 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-08-22 16:37:26,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 16:37:26,711 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-22 16:37:26,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:26,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217670479] [2020-08-22 16:37:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:26,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217670479] [2020-08-22 16:37:26,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:26,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 16:37:26,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710767928] [2020-08-22 16:37:26,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 16:37:26,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 16:37:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 16:37:26,964 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-22 16:37:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:27,694 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-22 16:37:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 16:37:27,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-22 16:37:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:27,705 INFO L225 Difference]: With dead ends: 274 [2020-08-22 16:37:27,705 INFO L226 Difference]: Without dead ends: 208 [2020-08-22 16:37:27,707 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-08-22 16:37:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-22 16:37:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-22 16:37:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-22 16:37:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-22 16:37:27,727 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-22 16:37:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:27,727 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-22 16:37:27,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 16:37:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-22 16:37:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 16:37:27,729 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:27,729 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-08-22 16:37:27,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 16:37:27,729 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-22 16:37:27,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:27,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352210942] [2020-08-22 16:37:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 16:37:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 16:37:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:27,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-08-22 16:37:27,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352210942] [2020-08-22 16:37:27,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:27,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 16:37:27,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112431877] [2020-08-22 16:37:27,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 16:37:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 16:37:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-22 16:37:27,941 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-22 16:37:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:28,426 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-22 16:37:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 16:37:28,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 16:37:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:28,429 INFO L225 Difference]: With dead ends: 258 [2020-08-22 16:37:28,430 INFO L226 Difference]: Without dead ends: 197 [2020-08-22 16:37:28,431 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-08-22 16:37:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-22 16:37:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-22 16:37:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-22 16:37:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-22 16:37:28,446 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-22 16:37:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:28,447 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-22 16:37:28,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 16:37:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-22 16:37:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 16:37:28,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:28,449 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-08-22 16:37:28,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 16:37:28,449 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-22 16:37:28,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:28,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051192568] [2020-08-22 16:37:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 16:37:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:28,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051192568] [2020-08-22 16:37:28,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:28,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 16:37:28,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931425254] [2020-08-22 16:37:28,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:37:28,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:37:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:37:28,706 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-22 16:37:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:29,614 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-22 16:37:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:37:29,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-22 16:37:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:29,617 INFO L225 Difference]: With dead ends: 243 [2020-08-22 16:37:29,617 INFO L226 Difference]: Without dead ends: 238 [2020-08-22 16:37:29,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:37:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-22 16:37:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-22 16:37:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-22 16:37:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-22 16:37:29,636 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-22 16:37:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:29,637 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-22 16:37:29,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:37:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-22 16:37:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 16:37:29,638 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:29,639 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-08-22 16:37:29,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 16:37:29,639 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-22 16:37:29,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:29,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953269166] [2020-08-22 16:37:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 16:37:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:29,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953269166] [2020-08-22 16:37:29,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:29,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 16:37:29,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191295491] [2020-08-22 16:37:29,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 16:37:29,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 16:37:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-22 16:37:29,896 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-22 16:37:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:31,223 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-22 16:37:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 16:37:31,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-22 16:37:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:31,228 INFO L225 Difference]: With dead ends: 246 [2020-08-22 16:37:31,228 INFO L226 Difference]: Without dead ends: 222 [2020-08-22 16:37:31,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-22 16:37:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-22 16:37:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-22 16:37:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-22 16:37:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-22 16:37:31,248 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-22 16:37:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:31,248 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-22 16:37:31,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 16:37:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-22 16:37:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 16:37:31,249 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:31,250 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-08-22 16:37:31,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 16:37:31,250 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-22 16:37:31,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:31,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623783759] [2020-08-22 16:37:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 16:37:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:31,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623783759] [2020-08-22 16:37:31,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:31,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 16:37:31,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364506659] [2020-08-22 16:37:31,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 16:37:31,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 16:37:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-22 16:37:31,477 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-22 16:37:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:31,754 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-22 16:37:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 16:37:31,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 16:37:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:31,755 INFO L225 Difference]: With dead ends: 203 [2020-08-22 16:37:31,756 INFO L226 Difference]: Without dead ends: 91 [2020-08-22 16:37:31,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:37:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-22 16:37:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-22 16:37:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-22 16:37:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-22 16:37:31,770 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-22 16:37:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:31,771 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-22 16:37:31,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 16:37:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-22 16:37:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-22 16:37:31,771 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:31,772 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-08-22 16:37:31,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 16:37:31,772 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-22 16:37:31,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:31,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998379917] [2020-08-22 16:37:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:31,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:32,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998379917] [2020-08-22 16:37:32,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:32,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 16:37:32,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330122583] [2020-08-22 16:37:32,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 16:37:32,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 16:37:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-22 16:37:32,033 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-22 16:37:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:32,494 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-22 16:37:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 16:37:32,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-22 16:37:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:32,496 INFO L225 Difference]: With dead ends: 119 [2020-08-22 16:37:32,497 INFO L226 Difference]: Without dead ends: 91 [2020-08-22 16:37:32,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-22 16:37:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-22 16:37:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-22 16:37:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-22 16:37:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-22 16:37:32,512 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-22 16:37:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:32,512 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-22 16:37:32,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 16:37:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-22 16:37:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 16:37:32,513 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:32,513 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-08-22 16:37:32,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 16:37:32,514 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-22 16:37:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:32,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279447687] [2020-08-22 16:37:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:32,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279447687] [2020-08-22 16:37:32,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:32,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 16:37:32,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25673241] [2020-08-22 16:37:32,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:37:32,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:37:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:37:32,725 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-22 16:37:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:32,932 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-22 16:37:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 16:37:32,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-22 16:37:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:32,933 INFO L225 Difference]: With dead ends: 122 [2020-08-22 16:37:32,934 INFO L226 Difference]: Without dead ends: 94 [2020-08-22 16:37:32,934 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-08-22 16:37:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-22 16:37:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-22 16:37:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 16:37:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-22 16:37:32,944 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-22 16:37:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:32,944 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-22 16:37:32,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:37:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-22 16:37:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 16:37:32,945 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:32,945 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-08-22 16:37:32,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 16:37:32,946 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-22 16:37:32,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:32,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821029084] [2020-08-22 16:37:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:33,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821029084] [2020-08-22 16:37:33,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:33,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 16:37:33,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38733461] [2020-08-22 16:37:33,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 16:37:33,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 16:37:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-22 16:37:33,165 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-22 16:37:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:33,492 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-22 16:37:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:37:33,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-22 16:37:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:33,494 INFO L225 Difference]: With dead ends: 112 [2020-08-22 16:37:33,494 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 16:37:33,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-22 16:37:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 16:37:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-22 16:37:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-22 16:37:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-22 16:37:33,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-22 16:37:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:33,507 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-22 16:37:33,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 16:37:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-22 16:37:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-22 16:37:33,508 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:33,509 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-08-22 16:37:33,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 16:37:33,509 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-22 16:37:33,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:33,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970489194] [2020-08-22 16:37:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:33,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970489194] [2020-08-22 16:37:33,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:33,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 16:37:33,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657250110] [2020-08-22 16:37:33,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:37:33,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:33,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:37:33,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:37:33,731 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-22 16:37:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:33,997 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-22 16:37:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 16:37:33,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-22 16:37:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:34,000 INFO L225 Difference]: With dead ends: 105 [2020-08-22 16:37:34,001 INFO L226 Difference]: Without dead ends: 100 [2020-08-22 16:37:34,002 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-08-22 16:37:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-22 16:37:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-22 16:37:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-22 16:37:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-22 16:37:34,029 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-22 16:37:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:34,030 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-22 16:37:34,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:37:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-22 16:37:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-22 16:37:34,037 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:34,038 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-08-22 16:37:34,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 16:37:34,038 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-22 16:37:34,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:34,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347651406] [2020-08-22 16:37:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:34,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347651406] [2020-08-22 16:37:34,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:34,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 16:37:34,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733712160] [2020-08-22 16:37:34,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 16:37:34,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:34,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 16:37:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-22 16:37:34,440 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-22 16:37:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:34,844 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-22 16:37:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:37:34,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-22 16:37:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:34,846 INFO L225 Difference]: With dead ends: 98 [2020-08-22 16:37:34,846 INFO L226 Difference]: Without dead ends: 91 [2020-08-22 16:37:34,847 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-08-22 16:37:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-22 16:37:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-22 16:37:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-22 16:37:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-22 16:37:34,860 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-22 16:37:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:34,861 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-22 16:37:34,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 16:37:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-22 16:37:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-22 16:37:34,864 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:34,864 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-08-22 16:37:34,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 16:37:34,865 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-22 16:37:34,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:34,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24425723] [2020-08-22 16:37:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:34,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:35,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24425723] [2020-08-22 16:37:35,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:35,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 16:37:35,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299850833] [2020-08-22 16:37:35,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:37:35,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:37:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:37:35,124 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-22 16:37:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:35,406 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-22 16:37:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:37:35,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-22 16:37:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:35,408 INFO L225 Difference]: With dead ends: 107 [2020-08-22 16:37:35,408 INFO L226 Difference]: Without dead ends: 76 [2020-08-22 16:37:35,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-08-22 16:37:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-22 16:37:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-22 16:37:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-22 16:37:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-22 16:37:35,417 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-22 16:37:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:35,417 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-22 16:37:35,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:37:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-22 16:37:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-22 16:37:35,418 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:35,418 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-08-22 16:37:35,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 16:37:35,419 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-22 16:37:35,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:35,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142835729] [2020-08-22 16:37:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:35,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142835729] [2020-08-22 16:37:35,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:35,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 16:37:35,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77562134] [2020-08-22 16:37:35,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:37:35,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:37:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:37:35,617 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-22 16:37:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:35,908 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-22 16:37:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 16:37:35,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-22 16:37:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:35,910 INFO L225 Difference]: With dead ends: 141 [2020-08-22 16:37:35,911 INFO L226 Difference]: Without dead ends: 134 [2020-08-22 16:37:35,911 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-08-22 16:37:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-22 16:37:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-22 16:37:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 16:37:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-22 16:37:35,926 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-22 16:37:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:35,927 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-22 16:37:35,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:37:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-22 16:37:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-22 16:37:35,928 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:35,928 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-08-22 16:37:35,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 16:37:35,929 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-22 16:37:35,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:35,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275853991] [2020-08-22 16:37:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:36,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275853991] [2020-08-22 16:37:36,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 16:37:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175225820] [2020-08-22 16:37:36,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 16:37:36,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:36,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 16:37:36,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-22 16:37:36,205 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-22 16:37:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:36,550 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-22 16:37:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:37:36,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-22 16:37:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:36,552 INFO L225 Difference]: With dead ends: 144 [2020-08-22 16:37:36,552 INFO L226 Difference]: Without dead ends: 133 [2020-08-22 16:37:36,553 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-08-22 16:37:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-22 16:37:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-22 16:37:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 16:37:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-22 16:37:36,568 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-22 16:37:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:36,568 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-22 16:37:36,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 16:37:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-22 16:37:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-22 16:37:36,570 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:37:36,570 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-08-22 16:37:36,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-22 16:37:36,570 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:37:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:37:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-22 16:37:36,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:37:36,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708437540] [2020-08-22 16:37:36,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:37:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:37:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 16:37:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 16:37:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 16:37:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 16:37:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 16:37:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-22 16:37:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:37:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:37:36,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708437540] [2020-08-22 16:37:36,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:37:36,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 16:37:36,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325215115] [2020-08-22 16:37:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 16:37:36,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:37:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 16:37:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-22 16:37:36,783 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-22 16:37:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:37:36,945 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-22 16:37:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 16:37:36,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-22 16:37:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:37:36,946 INFO L225 Difference]: With dead ends: 133 [2020-08-22 16:37:36,946 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 16:37:36,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-08-22 16:37:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 16:37:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 16:37:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 16:37:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 16:37:36,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-22 16:37:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:37:36,948 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 16:37:36,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 16:37:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 16:37:36,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 16:37:36,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-22 16:37:36,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 16:37:37,921 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 16:37:38,095 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-22 16:37:38,429 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-22 16:37:38,785 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-22 16:37:39,186 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-22 16:37:39,391 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-22 16:37:39,658 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-22 16:37:40,004 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-22 16:37:40,185 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-22 16:37:40,430 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-22 16:37:40,614 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-22 16:37:40,756 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-22 16:37:41,148 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-22 16:37:41,326 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-22 16:37:41,451 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-22 16:37:41,610 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-22 16:37:41,729 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-22 16:37:41,981 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-22 16:37:42,150 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-22 16:37:42,406 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-22 16:37:42,680 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-22 16:37:42,832 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-22 16:37:43,202 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-22 16:37:43,252 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-08-22 16:37:43,252 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-22 16:37:43,253 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-22 16:37:43,253 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-08-22 16:37:43,254 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-08-22 16:37:43,254 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-22 16:37:43,254 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-22 16:37:43,254 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-22 16:37:43,254 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-22 16:37:43,255 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-08-22 16:37:43,255 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-22 16:37:43,255 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-22 16:37:43,255 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-08-22 16:37:43,255 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-22 16:37:43,255 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-22 16:37:43,256 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-22 16:37:43,256 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-22 16:37:43,256 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-22 16:37:43,256 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-08-22 16:37:43,256 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-22 16:37:43,256 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-22 16:37:43,257 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-08-22 16:37:43,257 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-22 16:37:43,257 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-22 16:37:43,257 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-22 16:37:43,257 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-08-22 16:37:43,257 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-22 16:37:43,257 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-22 16:37:43,258 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-22 16:37:43,258 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-22 16:37:43,258 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-22 16:37:43,258 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-08-22 16:37:43,258 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-22 16:37:43,258 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-08-22 16:37:43,259 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-22 16:37:43,259 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-08-22 16:37:43,259 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-22 16:37:43,259 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-08-22 16:37:43,259 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-22 16:37:43,259 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-22 16:37:43,260 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-08-22 16:37:43,260 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-22 16:37:43,260 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-22 16:37:43,260 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-22 16:37:43,260 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-08-22 16:37:43,260 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-08-22 16:37:43,260 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-22 16:37:43,261 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-22 16:37:43,261 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-08-22 16:37:43,261 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-22 16:37:43,261 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-08-22 16:37:43,261 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-08-22 16:37:43,262 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-22 16:37:43,262 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-22 16:37:43,262 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-22 16:37:43,262 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-08-22 16:37:43,262 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-08-22 16:37:43,262 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-08-22 16:37:43,263 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-22 16:37:43,263 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-22 16:37:43,263 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-08-22 16:37:43,263 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-22 16:37:43,263 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-22 16:37:43,263 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-08-22 16:37:43,264 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-22 16:37:43,264 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-22 16:37:43,264 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-08-22 16:37:43,264 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-22 16:37:43,264 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-08-22 16:37:43,264 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-22 16:37:43,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-22 16:37:43,265 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-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-22 16:37:43,265 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-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-22 16:37:43,265 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-22 16:37:43,266 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-22 16:37:43,266 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-08-22 16:37:43,266 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-22 16:37:43,266 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-08-22 16:37:43,266 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-08-22 16:37:43,267 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-08-22 16:37:43,267 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-08-22 16:37:43,267 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-22 16:37:43,267 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-08-22 16:37:43,267 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-22 16:37:43,267 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-22 16:37:43,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-22 16:37:43,268 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-08-22 16:37:43,268 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 16:37:43,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-22 16:37:43,268 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-08-22 16:37:43,268 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-22 16:37:43,268 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-22 16:37:43,268 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-22 16:37:43,269 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-08-22 16:37:43,269 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-08-22 16:37:43,269 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-08-22 16:37:43,269 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-22 16:37:43,269 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-22 16:37:43,269 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-22 16:37:43,269 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-08-22 16:37:43,270 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-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-22 16:37:43,270 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-22 16:37:43,270 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-22 16:37:43,271 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-22 16:37:43,271 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-22 16:37:43,271 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-08-22 16:37:43,271 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-22 16:37:43,271 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-22 16:37:43,271 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-08-22 16:37:43,272 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-08-22 16:37:43,272 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-22 16:37:43,272 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-08-22 16:37:43,272 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-22 16:37:43,272 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-22 16:37:43,272 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-22 16:37:43,272 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-22 16:37:43,272 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-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-22 16:37:43,273 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-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-22 16:37:43,273 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-22 16:37:43,274 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-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-22 16:37:43,274 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-22 16:37:43,275 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-08-22 16:37:43,275 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-22 16:37:43,275 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-08-22 16:37:43,275 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-22 16:37:43,275 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-22 16:37:43,275 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-22 16:37:43,275 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-08-22 16:37:43,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 04:37:43 BoogieIcfgContainer [2020-08-22 16:37:43,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 16:37:43,343 INFO L168 Benchmark]: Toolchain (without parser) took 22141.27 ms. Allocated memory was 139.5 MB in the beginning and 474.5 MB in the end (delta: 335.0 MB). Free memory was 102.5 MB in the beginning and 181.9 MB in the end (delta: -79.4 MB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,343 INFO L168 Benchmark]: CDTParser took 0.27 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.74 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 180.1 MB in the end (delta: -77.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,344 INFO L168 Benchmark]: Boogie Preprocessor took 51.04 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 178.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,349 INFO L168 Benchmark]: RCFGBuilder took 838.85 ms. Allocated memory is still 203.4 MB. Free memory was 178.0 MB in the beginning and 132.1 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,350 INFO L168 Benchmark]: TraceAbstraction took 20727.70 ms. Allocated memory was 203.4 MB in the beginning and 474.5 MB in the end (delta: 271.1 MB). Free memory was 131.4 MB in the beginning and 181.9 MB in the end (delta: -50.5 MB). Peak memory consumption was 292.1 MB. Max. memory is 7.1 GB. [2020-08-22 16:37:43,354 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.27 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 513.74 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 180.1 MB in the end (delta: -77.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.04 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 178.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.85 ms. Allocated memory is still 203.4 MB. Free memory was 178.0 MB in the beginning and 132.1 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20727.70 ms. Allocated memory was 203.4 MB in the beginning and 474.5 MB in the end (delta: 271.1 MB). Free memory was 131.4 MB in the beginning and 181.9 MB in the end (delta: -50.5 MB). Peak memory consumption was 292.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: 14.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.1s 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s 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...