/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 --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:29:22,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:29:22,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:29:22,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:29:22,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:29:22,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:29:22,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:29:22,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:29:22,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:29:22,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:29:22,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:29:22,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:29:22,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:29:22,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:29:22,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:29:22,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:29:22,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:29:22,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:29:22,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:29:22,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:29:22,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:29:22,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:29:22,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:29:22,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:29:22,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:29:22,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:29:22,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:29:22,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:29:22,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:29:22,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:29:22,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:29:22,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:29:22,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:29:22,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:29:22,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:29:22,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:29:22,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:29:22,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:29:22,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:29:22,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:29:22,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:29:22,862 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-07-19 21:29:22,884 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:29:22,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:29:22,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:29:22,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:29:22,886 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:29:22,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:29:22,886 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:29:22,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:29:22,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:29:22,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:29:22,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:29:22,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:29:22,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:29:22,889 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:29:22,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:29:22,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:29:22,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:29:22,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:29:22,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:29:22,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:29:22,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:29:22,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:29:22,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:29:22,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:29:22,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:29:22,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:29:22,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:29:22,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:29:22,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:29:22,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:29:23,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:29:23,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:29:23,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:29:23,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:29:23,223 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:29:23,224 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-07-19 21:29:23,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358377956/6a46eca5e59a4a0bbcc4d5d337a79b0d/FLAG06e6feabc [2020-07-19 21:29:23,782 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:29:23,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-07-19 21:29:23,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358377956/6a46eca5e59a4a0bbcc4d5d337a79b0d/FLAG06e6feabc [2020-07-19 21:29:24,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358377956/6a46eca5e59a4a0bbcc4d5d337a79b0d [2020-07-19 21:29:24,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:29:24,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:29:24,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:29:24,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:29:24,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:29:24,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c82b216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24, skipping insertion in model container [2020-07-19 21:29:24,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:29:24,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:29:24,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:29:24,534 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:29:24,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:29:24,749 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:29:24,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24 WrapperNode [2020-07-19 21:29:24,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:29:24,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:29:24,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:29:24,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:29:24,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (1/1) ... [2020-07-19 21:29:24,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:29:24,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:29:24,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:29:24,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:29:24,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (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-07-19 21:29:24,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:29:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2020-07-19 21:29:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2020-07-19 21:29:24,890 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2020-07-19 21:29:24,890 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-07-19 21:29:24,890 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2020-07-19 21:29:24,890 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-07-19 21:29:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-07-19 21:29:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2020-07-19 21:29:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2020-07-19 21:29:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-07-19 21:29:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-07-19 21:29:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-07-19 21:29:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-07-19 21:29:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:29:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-07-19 21:29:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:29:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:29:25,151 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,214 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-07-19 21:29:25,214 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-07-19 21:29:25,242 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,356 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-07-19 21:29:25,357 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-07-19 21:29:25,359 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,397 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-07-19 21:29:25,397 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-07-19 21:29:25,404 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,464 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-07-19 21:29:25,465 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-07-19 21:29:25,552 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,569 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-07-19 21:29:25,569 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-07-19 21:29:25,592 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-19 21:29:25,690 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-07-19 21:29:25,690 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-07-19 21:29:25,708 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:29:25,709 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 21:29:25,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:29:25 BoogieIcfgContainer [2020-07-19 21:29:25,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:29:25,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:29:25,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:29:25,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:29:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:29:24" (1/3) ... [2020-07-19 21:29:25,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dfe8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:29:25, skipping insertion in model container [2020-07-19 21:29:25,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:29:24" (2/3) ... [2020-07-19 21:29:25,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dfe8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:29:25, skipping insertion in model container [2020-07-19 21:29:25,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:29:25" (3/3) ... [2020-07-19 21:29:25,723 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2020-07-19 21:29:25,733 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:29:25,741 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:29:25,752 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:29:25,776 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:29:25,776 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:29:25,776 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:29:25,776 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:29:25,776 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:29:25,776 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:29:25,777 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:29:25,777 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:29:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2020-07-19 21:29:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-19 21:29:25,808 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:25,809 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-07-19 21:29:25,810 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2020-07-19 21:29:25,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:25,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693743603] [2020-07-19 21:29:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:26,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693743603] [2020-07-19 21:29:26,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:26,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:29:26,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312159600] [2020-07-19 21:29:26,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:29:26,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:29:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:29:26,273 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 5 states. [2020-07-19 21:29:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:27,309 INFO L93 Difference]: Finished difference Result 416 states and 625 transitions. [2020-07-19 21:29:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:29:27,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-19 21:29:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:27,340 INFO L225 Difference]: With dead ends: 416 [2020-07-19 21:29:27,340 INFO L226 Difference]: Without dead ends: 256 [2020-07-19 21:29:27,355 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-07-19 21:29:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-07-19 21:29:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2020-07-19 21:29:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-07-19 21:29:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2020-07-19 21:29:27,485 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2020-07-19 21:29:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:27,487 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2020-07-19 21:29:27,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:29:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2020-07-19 21:29:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-19 21:29:27,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:27,490 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] [2020-07-19 21:29:27,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:29:27,491 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2020-07-19 21:29:27,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:27,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473442483] [2020-07-19 21:29:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:27,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473442483] [2020-07-19 21:29:27,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:27,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:29:27,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892853161] [2020-07-19 21:29:27,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:29:27,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:29:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:29:27,804 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 6 states. [2020-07-19 21:29:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:29,016 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2020-07-19 21:29:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:29:29,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-19 21:29:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:29,023 INFO L225 Difference]: With dead ends: 401 [2020-07-19 21:29:29,023 INFO L226 Difference]: Without dead ends: 343 [2020-07-19 21:29:29,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-07-19 21:29:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2020-07-19 21:29:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-07-19 21:29:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2020-07-19 21:29:29,092 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2020-07-19 21:29:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:29,093 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2020-07-19 21:29:29,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:29:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2020-07-19 21:29:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-19 21:29:29,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:29,095 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] [2020-07-19 21:29:29,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:29:29,096 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2020-07-19 21:29:29,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:29,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811934037] [2020-07-19 21:29:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:29,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811934037] [2020-07-19 21:29:29,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:29,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:29:29,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107012485] [2020-07-19 21:29:29,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:29:29,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:29:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:29:29,278 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand 6 states. [2020-07-19 21:29:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:30,065 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2020-07-19 21:29:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:29:30,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-19 21:29:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:30,071 INFO L225 Difference]: With dead ends: 478 [2020-07-19 21:29:30,071 INFO L226 Difference]: Without dead ends: 362 [2020-07-19 21:29:30,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-07-19 21:29:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2020-07-19 21:29:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-07-19 21:29:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2020-07-19 21:29:30,116 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2020-07-19 21:29:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:30,117 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2020-07-19 21:29:30,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:29:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2020-07-19 21:29:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-19 21:29:30,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:30,128 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] [2020-07-19 21:29:30,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 21:29:30,129 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2020-07-19 21:29:30,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:30,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286817743] [2020-07-19 21:29:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:30,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286817743] [2020-07-19 21:29:30,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:30,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:29:30,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910836611] [2020-07-19 21:29:30,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:29:30,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:29:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:29:30,343 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand 6 states. [2020-07-19 21:29:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:30,930 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2020-07-19 21:29:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:29:30,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-19 21:29:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:30,935 INFO L225 Difference]: With dead ends: 344 [2020-07-19 21:29:30,935 INFO L226 Difference]: Without dead ends: 340 [2020-07-19 21:29:30,936 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-07-19 21:29:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-19 21:29:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2020-07-19 21:29:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-07-19 21:29:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2020-07-19 21:29:30,963 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2020-07-19 21:29:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:30,963 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2020-07-19 21:29:30,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:29:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2020-07-19 21:29:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-19 21:29:30,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:30,966 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] [2020-07-19 21:29:30,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 21:29:30,966 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2020-07-19 21:29:30,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:30,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902678161] [2020-07-19 21:29:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:31,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902678161] [2020-07-19 21:29:31,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:31,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-19 21:29:31,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153281109] [2020-07-19 21:29:31,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-19 21:29:31,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-19 21:29:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:31,139 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 8 states. [2020-07-19 21:29:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:32,050 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2020-07-19 21:29:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:29:32,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-19 21:29:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:32,058 INFO L225 Difference]: With dead ends: 385 [2020-07-19 21:29:32,058 INFO L226 Difference]: Without dead ends: 319 [2020-07-19 21:29:32,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-07-19 21:29:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2020-07-19 21:29:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-07-19 21:29:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2020-07-19 21:29:32,093 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2020-07-19 21:29:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:32,095 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2020-07-19 21:29:32,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-19 21:29:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2020-07-19 21:29:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-19 21:29:32,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:32,097 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-07-19 21:29:32,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 21:29:32,097 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2020-07-19 21:29:32,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:32,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696347072] [2020-07-19 21:29:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:32,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696347072] [2020-07-19 21:29:32,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:32,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-19 21:29:32,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034948246] [2020-07-19 21:29:32,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-19 21:29:32,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-19 21:29:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:32,298 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand 8 states. [2020-07-19 21:29:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:32,687 INFO L93 Difference]: Finished difference Result 310 states and 413 transitions. [2020-07-19 21:29:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:29:32,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-19 21:29:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:32,690 INFO L225 Difference]: With dead ends: 310 [2020-07-19 21:29:32,690 INFO L226 Difference]: Without dead ends: 102 [2020-07-19 21:29:32,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-19 21:29:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-19 21:29:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-19 21:29:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-07-19 21:29:32,701 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2020-07-19 21:29:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:32,701 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-07-19 21:29:32,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-19 21:29:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-07-19 21:29:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-19 21:29:32,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:32,702 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] [2020-07-19 21:29:32,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 21:29:32,703 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2020-07-19 21:29:32,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:32,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130277558] [2020-07-19 21:29:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:32,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130277558] [2020-07-19 21:29:32,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:32,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-19 21:29:32,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080379304] [2020-07-19 21:29:32,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-19 21:29:32,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-19 21:29:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:32,959 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 8 states. [2020-07-19 21:29:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:33,182 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2020-07-19 21:29:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:29:33,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-19 21:29:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:33,183 INFO L225 Difference]: With dead ends: 130 [2020-07-19 21:29:33,184 INFO L226 Difference]: Without dead ends: 100 [2020-07-19 21:29:33,184 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-07-19 21:29:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-19 21:29:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-07-19 21:29:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-19 21:29:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-07-19 21:29:33,194 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2020-07-19 21:29:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:33,195 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-07-19 21:29:33,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-19 21:29:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-07-19 21:29:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-19 21:29:33,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:33,196 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] [2020-07-19 21:29:33,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 21:29:33,196 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2020-07-19 21:29:33,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:33,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149688532] [2020-07-19 21:29:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:33,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149688532] [2020-07-19 21:29:33,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:33,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 21:29:33,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204541480] [2020-07-19 21:29:33,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:29:33,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:29:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:29:33,419 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 11 states. [2020-07-19 21:29:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:33,649 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2020-07-19 21:29:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:29:33,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-07-19 21:29:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:33,651 INFO L225 Difference]: With dead ends: 152 [2020-07-19 21:29:33,651 INFO L226 Difference]: Without dead ends: 111 [2020-07-19 21:29:33,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-19 21:29:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-07-19 21:29:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-19 21:29:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2020-07-19 21:29:33,664 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2020-07-19 21:29:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:33,665 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2020-07-19 21:29:33,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:29:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2020-07-19 21:29:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-19 21:29:33,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:33,666 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] [2020-07-19 21:29:33,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-19 21:29:33,666 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2020-07-19 21:29:33,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:33,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940619801] [2020-07-19 21:29:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:33,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-07-19 21:29:33,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940619801] [2020-07-19 21:29:33,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:33,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 21:29:33,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492424347] [2020-07-19 21:29:33,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:29:33,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:29:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:29:33,947 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 11 states. [2020-07-19 21:29:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:34,223 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-07-19 21:29:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:29:34,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-07-19 21:29:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:34,225 INFO L225 Difference]: With dead ends: 116 [2020-07-19 21:29:34,225 INFO L226 Difference]: Without dead ends: 109 [2020-07-19 21:29:34,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:29:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-19 21:29:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2020-07-19 21:29:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-19 21:29:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-07-19 21:29:34,239 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2020-07-19 21:29:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:34,239 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-07-19 21:29:34,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:29:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2020-07-19 21:29:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-19 21:29:34,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:34,241 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] [2020-07-19 21:29:34,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-19 21:29:34,242 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2020-07-19 21:29:34,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:34,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783108092] [2020-07-19 21:29:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:34,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783108092] [2020-07-19 21:29:34,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:34,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-19 21:29:34,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400307274] [2020-07-19 21:29:34,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-19 21:29:34,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-19 21:29:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:29:34,425 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 8 states. [2020-07-19 21:29:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:34,757 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2020-07-19 21:29:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:29:34,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2020-07-19 21:29:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:34,761 INFO L225 Difference]: With dead ends: 122 [2020-07-19 21:29:34,761 INFO L226 Difference]: Without dead ends: 117 [2020-07-19 21:29:34,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:29:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-19 21:29:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2020-07-19 21:29:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-19 21:29:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2020-07-19 21:29:34,774 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2020-07-19 21:29:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:34,775 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2020-07-19 21:29:34,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-19 21:29:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2020-07-19 21:29:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-19 21:29:34,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:34,777 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] [2020-07-19 21:29:34,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-19 21:29:34,777 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2020-07-19 21:29:34,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:34,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79535049] [2020-07-19 21:29:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:35,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79535049] [2020-07-19 21:29:35,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:35,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:29:35,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208490991] [2020-07-19 21:29:35,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:29:35,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:35,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:29:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:29:35,085 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2020-07-19 21:29:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:35,284 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2020-07-19 21:29:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:29:35,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-07-19 21:29:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:35,286 INFO L225 Difference]: With dead ends: 146 [2020-07-19 21:29:35,286 INFO L226 Difference]: Without dead ends: 102 [2020-07-19 21:29:35,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:29:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-19 21:29:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-19 21:29:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-19 21:29:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2020-07-19 21:29:35,301 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2020-07-19 21:29:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:35,304 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2020-07-19 21:29:35,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:29:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2020-07-19 21:29:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-19 21:29:35,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:35,305 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-07-19 21:29:35,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-19 21:29:35,305 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2020-07-19 21:29:35,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:35,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221008871] [2020-07-19 21:29:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:35,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221008871] [2020-07-19 21:29:35,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:35,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 21:29:35,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972843862] [2020-07-19 21:29:35,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:29:35,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:29:35,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:29:35,529 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 11 states. [2020-07-19 21:29:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:35,911 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-07-19 21:29:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-19 21:29:35,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-19 21:29:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:35,913 INFO L225 Difference]: With dead ends: 132 [2020-07-19 21:29:35,913 INFO L226 Difference]: Without dead ends: 94 [2020-07-19 21:29:35,914 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-07-19 21:29:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-19 21:29:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-07-19 21:29:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-19 21:29:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2020-07-19 21:29:35,924 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2020-07-19 21:29:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:35,924 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2020-07-19 21:29:35,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:29:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-19 21:29:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-19 21:29:35,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:35,926 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] [2020-07-19 21:29:35,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-19 21:29:35,926 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2020-07-19 21:29:35,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:35,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980377961] [2020-07-19 21:29:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:36,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980377961] [2020-07-19 21:29:36,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:36,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 21:29:36,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025078589] [2020-07-19 21:29:36,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:29:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:29:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:29:36,104 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2020-07-19 21:29:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:36,296 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2020-07-19 21:29:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:29:36,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-07-19 21:29:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:36,298 INFO L225 Difference]: With dead ends: 130 [2020-07-19 21:29:36,298 INFO L226 Difference]: Without dead ends: 100 [2020-07-19 21:29:36,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:29:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-19 21:29:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2020-07-19 21:29:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-19 21:29:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2020-07-19 21:29:36,310 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2020-07-19 21:29:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:36,310 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2020-07-19 21:29:36,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:29:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2020-07-19 21:29:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-19 21:29:36,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:36,312 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] [2020-07-19 21:29:36,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-19 21:29:36,312 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2020-07-19 21:29:36,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:36,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644947801] [2020-07-19 21:29:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:36,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644947801] [2020-07-19 21:29:36,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:36,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:29:36,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258391436] [2020-07-19 21:29:36,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:29:36,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:29:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:36,575 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 12 states. [2020-07-19 21:29:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:36,886 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2020-07-19 21:29:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:29:36,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-07-19 21:29:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:36,888 INFO L225 Difference]: With dead ends: 110 [2020-07-19 21:29:36,888 INFO L226 Difference]: Without dead ends: 103 [2020-07-19 21:29:36,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:29:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-19 21:29:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2020-07-19 21:29:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-19 21:29:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2020-07-19 21:29:36,899 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2020-07-19 21:29:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:36,899 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2020-07-19 21:29:36,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:29:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2020-07-19 21:29:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-19 21:29:36,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:36,900 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] [2020-07-19 21:29:36,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-19 21:29:36,901 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2020-07-19 21:29:36,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:36,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384627058] [2020-07-19 21:29:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:37,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384627058] [2020-07-19 21:29:37,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:37,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:29:37,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616948394] [2020-07-19 21:29:37,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:29:37,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:29:37,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:37,152 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 12 states. [2020-07-19 21:29:37,393 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-07-19 21:29:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:37,778 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2020-07-19 21:29:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-19 21:29:37,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-07-19 21:29:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:37,780 INFO L225 Difference]: With dead ends: 109 [2020-07-19 21:29:37,780 INFO L226 Difference]: Without dead ends: 91 [2020-07-19 21:29:37,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-07-19 21:29:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-19 21:29:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2020-07-19 21:29:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-19 21:29:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2020-07-19 21:29:37,794 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2020-07-19 21:29:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:37,794 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2020-07-19 21:29:37,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:29:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2020-07-19 21:29:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-19 21:29:37,795 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:37,795 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] [2020-07-19 21:29:37,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-19 21:29:37,795 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2020-07-19 21:29:37,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:37,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334925300] [2020-07-19 21:29:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:38,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334925300] [2020-07-19 21:29:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:29:38,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523653260] [2020-07-19 21:29:38,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:29:38,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:29:38,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:29:38,136 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 10 states. [2020-07-19 21:29:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:38,506 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-19 21:29:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:29:38,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-07-19 21:29:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:38,507 INFO L225 Difference]: With dead ends: 98 [2020-07-19 21:29:38,508 INFO L226 Difference]: Without dead ends: 78 [2020-07-19 21:29:38,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-19 21:29:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-19 21:29:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-19 21:29:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-19 21:29:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-07-19 21:29:38,524 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2020-07-19 21:29:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:38,524 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-07-19 21:29:38,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:29:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-19 21:29:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-19 21:29:38,526 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:38,526 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] [2020-07-19 21:29:38,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-19 21:29:38,527 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2020-07-19 21:29:38,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:38,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560340389] [2020-07-19 21:29:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:38,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560340389] [2020-07-19 21:29:38,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:38,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:29:38,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485204564] [2020-07-19 21:29:38,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:29:38,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:29:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:29:38,830 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2020-07-19 21:29:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:39,062 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2020-07-19 21:29:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:29:39,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-07-19 21:29:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:39,063 INFO L225 Difference]: With dead ends: 87 [2020-07-19 21:29:39,063 INFO L226 Difference]: Without dead ends: 78 [2020-07-19 21:29:39,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:29:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-19 21:29:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-19 21:29:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-19 21:29:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-07-19 21:29:39,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2020-07-19 21:29:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:39,074 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-07-19 21:29:39,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:29:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-19 21:29:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-19 21:29:39,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:29:39,078 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, 1, 1] [2020-07-19 21:29:39,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-19 21:29:39,078 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:29:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:29:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2020-07-19 21:29:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:29:39,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970894354] [2020-07-19 21:29:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2c9da315 [2020-07-19 21:29:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:29:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:29:39,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970894354] [2020-07-19 21:29:39,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:29:39,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 21:29:39,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556685913] [2020-07-19 21:29:39,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:29:39,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:29:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:29:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:29:39,371 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 11 states. [2020-07-19 21:29:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:29:39,573 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-19 21:29:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:29:39,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-19 21:29:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:29:39,574 INFO L225 Difference]: With dead ends: 78 [2020-07-19 21:29:39,575 INFO L226 Difference]: Without dead ends: 0 [2020-07-19 21:29:39,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:29:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-19 21:29:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-19 21:29:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-19 21:29:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-19 21:29:39,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2020-07-19 21:29:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:29:39,577 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-19 21:29:39,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:29:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-19 21:29:39,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-19 21:29:39,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-19 21:29:39,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-19 21:29:40,363 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-07-19 21:29:40,717 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 18 [2020-07-19 21:29:41,296 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-07-19 21:29:42,350 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2020-07-19 21:29:42,471 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2020-07-19 21:29:43,108 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-07-19 21:29:43,225 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2020-07-19 21:29:43,484 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2020-07-19 21:29:43,968 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-07-19 21:29:44,590 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 566 573) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,590 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 566 573) no Hoare annotation was computed. [2020-07-19 21:29:44,590 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 566 573) no Hoare annotation was computed. [2020-07-19 21:29:44,590 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 616 626) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,591 INFO L264 CegarLoopResult]: At program point L622(line 622) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,591 INFO L268 CegarLoopResult]: For program point L622-1(line 622) no Hoare annotation was computed. [2020-07-19 21:29:44,591 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 616 626) no Hoare annotation was computed. [2020-07-19 21:29:44,591 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 616 626) no Hoare annotation was computed. [2020-07-19 21:29:44,592 INFO L268 CegarLoopResult]: For program point L704(lines 704 725) no Hoare annotation was computed. [2020-07-19 21:29:44,592 INFO L268 CegarLoopResult]: For program point L698(lines 698 727) no Hoare annotation was computed. [2020-07-19 21:29:44,592 INFO L268 CegarLoopResult]: For program point KbFilter_PowerEXIT(lines 687 742) no Hoare annotation was computed. [2020-07-19 21:29:44,592 INFO L264 CegarLoopResult]: At program point KbFilter_PowerENTRY(lines 687 742) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,592 INFO L268 CegarLoopResult]: For program point L707(lines 707 724) no Hoare annotation was computed. [2020-07-19 21:29:44,592 INFO L264 CegarLoopResult]: At program point L738(line 738) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2020-07-19 21:29:44,592 INFO L268 CegarLoopResult]: For program point L738-1(line 738) no Hoare annotation was computed. [2020-07-19 21:29:44,593 INFO L268 CegarLoopResult]: For program point L701(lines 701 726) no Hoare annotation was computed. [2020-07-19 21:29:44,593 INFO L264 CegarLoopResult]: At program point L732(line 732) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,593 INFO L264 CegarLoopResult]: At program point L699(lines 698 727) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,593 INFO L268 CegarLoopResult]: For program point L732-1(lines 728 734) no Hoare annotation was computed. [2020-07-19 21:29:44,593 INFO L268 CegarLoopResult]: For program point KbFilter_PowerFINAL(lines 687 742) no Hoare annotation was computed. [2020-07-19 21:29:44,593 INFO L264 CegarLoopResult]: At program point L722(lines 697 741) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,593 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 41 54) no Hoare annotation was computed. [2020-07-19 21:29:44,594 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 41 54) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,594 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 41 54) no Hoare annotation was computed. [2020-07-19 21:29:44,594 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 55 76) no Hoare annotation was computed. [2020-07-19 21:29:44,594 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 55 76) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,594 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 55 76) no Hoare annotation was computed. [2020-07-19 21:29:44,594 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 1007 1014) the Hoare annotation is: true [2020-07-19 21:29:44,594 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 1007 1014) no Hoare annotation was computed. [2020-07-19 21:29:44,594 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 1007 1014) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point L448(lines 448 450) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 293 464) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L264 CegarLoopResult]: At program point L374(lines 373 406) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point L432(lines 432 434) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point L366(lines 366 407) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point L383(line 383) no Hoare annotation was computed. [2020-07-19 21:29:44,595 INFO L268 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-07-19 21:29:44,596 INFO L268 CegarLoopResult]: For program point L342(lines 328 411) no Hoare annotation was computed. [2020-07-19 21:29:44,596 INFO L264 CegarLoopResult]: At program point L367(lines 366 407) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,596 INFO L264 CegarLoopResult]: At program point L326(line 326) the Hoare annotation is: (or (and (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,596 INFO L268 CegarLoopResult]: For program point L326-1(lines 322 463) no Hoare annotation was computed. [2020-07-19 21:29:44,596 INFO L268 CegarLoopResult]: For program point L351(lines 351 410) no Hoare annotation was computed. [2020-07-19 21:29:44,596 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 293 464) no Hoare annotation was computed. [2020-07-19 21:29:44,596 INFO L268 CegarLoopResult]: For program point L393(line 393) no Hoare annotation was computed. [2020-07-19 21:29:44,597 INFO L264 CegarLoopResult]: At program point L352(lines 351 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,597 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 293 464) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,597 INFO L264 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,597 INFO L264 CegarLoopResult]: At program point L427(lines 420 460) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,597 INFO L268 CegarLoopResult]: For program point L361(lines 361 408) no Hoare annotation was computed. [2020-07-19 21:29:44,597 INFO L264 CegarLoopResult]: At program point L328(lines 322 463) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,598 INFO L268 CegarLoopResult]: For program point L452(lines 452 454) no Hoare annotation was computed. [2020-07-19 21:29:44,598 INFO L264 CegarLoopResult]: At program point L419(lines 412 461) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,598 INFO L268 CegarLoopResult]: For program point L378(line 378) no Hoare annotation was computed. [2020-07-19 21:29:44,598 INFO L268 CegarLoopResult]: For program point L337(lines 337 340) no Hoare annotation was computed. [2020-07-19 21:29:44,598 INFO L264 CegarLoopResult]: At program point L337-2(lines 337 340) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-19 21:29:44,598 INFO L268 CegarLoopResult]: For program point L428(lines 412 461) no Hoare annotation was computed. [2020-07-19 21:29:44,598 INFO L264 CegarLoopResult]: At program point L362(lines 361 408) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-19 21:29:44,598 INFO L268 CegarLoopResult]: For program point L371(lines 371 406) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L429(lines 429 458) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L421(lines 421 425) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L388(line 388) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L413(lines 413 417) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L264 CegarLoopResult]: At program point L372(lines 371 406) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L430(lines 430 457) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L356(lines 356 409) no Hoare annotation was computed. [2020-07-19 21:29:44,599 INFO L268 CegarLoopResult]: For program point L447(lines 447 455) no Hoare annotation was computed. [2020-07-19 21:29:44,600 INFO L264 CegarLoopResult]: At program point L439(lines 430 457) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,600 INFO L268 CegarLoopResult]: For program point L431(lines 431 437) no Hoare annotation was computed. [2020-07-19 21:29:44,600 INFO L268 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2020-07-19 21:29:44,600 INFO L264 CegarLoopResult]: At program point L357(lines 356 409) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-19 21:29:44,600 INFO L264 CegarLoopResult]: At program point L510(lines 509 524) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,600 INFO L268 CegarLoopResult]: For program point L539(lines 539 546) no Hoare annotation was computed. [2020-07-19 21:29:44,601 INFO L268 CegarLoopResult]: For program point L502(lines 502 525) no Hoare annotation was computed. [2020-07-19 21:29:44,601 INFO L268 CegarLoopResult]: For program point L531(lines 531 537) no Hoare annotation was computed. [2020-07-19 21:29:44,601 INFO L264 CegarLoopResult]: At program point L544(line 544) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,601 INFO L268 CegarLoopResult]: For program point L544-1(lines 526 548) no Hoare annotation was computed. [2020-07-19 21:29:44,601 INFO L268 CegarLoopResult]: For program point L507(lines 507 524) no Hoare annotation was computed. [2020-07-19 21:29:44,601 INFO L264 CegarLoopResult]: At program point L503(lines 502 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))))) [2020-07-19 21:29:44,602 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 479 551) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse1 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse2 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~NP~0) .cse0 .cse1) .cse2 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse2 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,602 INFO L264 CegarLoopResult]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,602 INFO L268 CegarLoopResult]: For program point L487(lines 487 499) no Hoare annotation was computed. [2020-07-19 21:29:44,602 INFO L268 CegarLoopResult]: For program point L487-1(lines 487 499) no Hoare annotation was computed. [2020-07-19 21:29:44,602 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 479 551) no Hoare annotation was computed. [2020-07-19 21:29:44,602 INFO L264 CegarLoopResult]: At program point L508(lines 507 524) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))))) [2020-07-19 21:29:44,603 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 479 551) no Hoare annotation was computed. [2020-07-19 21:29:44,603 INFO L268 CegarLoopResult]: For program point L530(lines 530 547) no Hoare annotation was computed. [2020-07-19 21:29:44,603 INFO L268 CegarLoopResult]: For program point L493(lines 493 497) no Hoare annotation was computed. [2020-07-19 21:29:44,603 INFO L264 CegarLoopResult]: At program point L522(lines 486 550) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)))) (or (not (<= 1 ~NP~0)) (and (<= 0 IofCallDriver_~returnVal2~0) .cse0 (<= IofCallDriver_~returnVal2~0 0) .cse1) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (and (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse0 .cse1) (and .cse0 (<= 259 IofCallDriver_~returnVal2~0) .cse1 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0)))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse2 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,603 INFO L264 CegarLoopResult]: At program point L489(line 489) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-19 21:29:44,603 INFO L268 CegarLoopResult]: For program point L489-1(line 489) no Hoare annotation was computed. [2020-07-19 21:29:44,604 INFO L264 CegarLoopResult]: At program point L473(line 473) the Hoare annotation is: (or (not (= 1 ~setEventCalled~0)) (not (<= ~NP~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-19 21:29:44,604 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 465 478) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= ~s~0 ~NP~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,604 INFO L268 CegarLoopResult]: For program point L473-1(lines 465 478) no Hoare annotation was computed. [2020-07-19 21:29:44,604 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 465 478) no Hoare annotation was computed. [2020-07-19 21:29:44,604 INFO L268 CegarLoopResult]: For program point L795(lines 795 815) no Hoare annotation was computed. [2020-07-19 21:29:44,604 INFO L268 CegarLoopResult]: For program point L758(lines 758 762) no Hoare annotation was computed. [2020-07-19 21:29:44,604 INFO L264 CegarLoopResult]: At program point L787(lines 751 818) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,605 INFO L268 CegarLoopResult]: For program point PoCallDriverEXIT(lines 743 819) no Hoare annotation was computed. [2020-07-19 21:29:44,605 INFO L264 CegarLoopResult]: At program point L754(line 754) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,605 INFO L268 CegarLoopResult]: For program point L754-1(line 754) no Hoare annotation was computed. [2020-07-19 21:29:44,605 INFO L264 CegarLoopResult]: At program point L812(line 812) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,605 INFO L268 CegarLoopResult]: For program point L812-1(lines 791 816) no Hoare annotation was computed. [2020-07-19 21:29:44,605 INFO L264 CegarLoopResult]: At program point L775(lines 774 789) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,605 INFO L268 CegarLoopResult]: For program point L767(lines 767 790) no Hoare annotation was computed. [2020-07-19 21:29:44,605 INFO L268 CegarLoopResult]: For program point PoCallDriverFINAL(lines 743 819) no Hoare annotation was computed. [2020-07-19 21:29:44,606 INFO L264 CegarLoopResult]: At program point PoCallDriverENTRY(lines 743 819) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,606 INFO L268 CegarLoopResult]: For program point L772(lines 772 789) no Hoare annotation was computed. [2020-07-19 21:29:44,606 INFO L264 CegarLoopResult]: At program point L768(lines 767 790) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,606 INFO L264 CegarLoopResult]: At program point L760(line 760) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,606 INFO L268 CegarLoopResult]: For program point L752(lines 752 764) no Hoare annotation was computed. [2020-07-19 21:29:44,606 INFO L268 CegarLoopResult]: For program point L752-1(lines 752 764) no Hoare annotation was computed. [2020-07-19 21:29:44,606 INFO L264 CegarLoopResult]: At program point L773(lines 772 789) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-19 21:29:44,607 INFO L268 CegarLoopResult]: For program point L798(lines 798 804) no Hoare annotation was computed. [2020-07-19 21:29:44,607 INFO L268 CegarLoopResult]: For program point L807(lines 807 814) no Hoare annotation was computed. [2020-07-19 21:29:44,607 INFO L268 CegarLoopResult]: For program point L636(lines 636 654) no Hoare annotation was computed. [2020-07-19 21:29:44,607 INFO L268 CegarLoopResult]: For program point KbFilter_CreateCloseEXIT(lines 627 662) no Hoare annotation was computed. [2020-07-19 21:29:44,607 INFO L264 CegarLoopResult]: At program point L651(lines 639 653) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,607 INFO L264 CegarLoopResult]: At program point L643(lines 636 654) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,607 INFO L268 CegarLoopResult]: For program point L639(lines 639 653) no Hoare annotation was computed. [2020-07-19 21:29:44,607 INFO L264 CegarLoopResult]: At program point KbFilter_CreateCloseENTRY(lines 627 662) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,608 INFO L264 CegarLoopResult]: At program point L658(line 658) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point L658-1(line 658) no Hoare annotation was computed. [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point KbFilter_CreateCloseFINAL(lines 627 662) no Hoare annotation was computed. [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point L642(lines 642 652) no Hoare annotation was computed. [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:29:44,608 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:29:44,608 INFO L268 CegarLoopResult]: For program point L894(lines 894 982) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L264 CegarLoopResult]: At program point L890(lines 889 984) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,609 INFO L268 CegarLoopResult]: For program point L915(lines 915 976) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L264 CegarLoopResult]: At program point L882(lines 881 986) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,609 INFO L268 CegarLoopResult]: For program point KbFilter_InternIoCtlEXIT(lines 820 1005) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L268 CegarLoopResult]: For program point L932(lines 932 971) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L268 CegarLoopResult]: For program point L957-1(lines 957 959) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L268 CegarLoopResult]: For program point L908(lines 908 978) no Hoare annotation was computed. [2020-07-19 21:29:44,609 INFO L264 CegarLoopResult]: At program point L970(lines 865 1004) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,610 INFO L264 CegarLoopResult]: At program point L933(lines 873 988) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,610 INFO L264 CegarLoopResult]: At program point L995(line 995) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L995-1(line 995) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L929(lines 929 972) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L954(lines 954 956) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L954-2(lines 932 969) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L938(lines 938 941) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L901(lines 901 980) no Hoare annotation was computed. [2020-07-19 21:29:44,610 INFO L268 CegarLoopResult]: For program point L922(lines 922 974) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point L889(lines 889 984) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L264 CegarLoopResult]: At program point KbFilter_InternIoCtlENTRY(lines 820 1005) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point L881(lines 881 986) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point L873(lines 873 988) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L264 CegarLoopResult]: At program point L1001(line 1001) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point KbFilter_InternIoCtlFINAL(lines 820 1005) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 574 615) no Hoare annotation was computed. [2020-07-19 21:29:44,611 INFO L268 CegarLoopResult]: For program point L601(lines 601 613) no Hoare annotation was computed. [2020-07-19 21:29:44,612 INFO L264 CegarLoopResult]: At program point L587(lines 579 598) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3) (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 (not (<= ~NP~0 1)) .cse2 .cse3))) [2020-07-19 21:29:44,612 INFO L268 CegarLoopResult]: For program point L579(lines 579 598) no Hoare annotation was computed. [2020-07-19 21:29:44,612 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 574 615) no Hoare annotation was computed. [2020-07-19 21:29:44,612 INFO L264 CegarLoopResult]: At program point L604(lines 603 613) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-19 21:29:44,612 INFO L264 CegarLoopResult]: At program point L602(lines 601 613) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-19 21:29:44,613 INFO L264 CegarLoopResult]: At program point L594(line 594) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 1 ~compRegistered~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 .cse2 .cse3) (or (not (= 1 |old(~setEventCalled~0)|)) (not (<= ~NP~0 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3))) [2020-07-19 21:29:44,613 INFO L268 CegarLoopResult]: For program point L592(lines 592 596) no Hoare annotation was computed. [2020-07-19 21:29:44,613 INFO L268 CegarLoopResult]: For program point L592-1(lines 579 598) no Hoare annotation was computed. [2020-07-19 21:29:44,613 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 574 615) the Hoare annotation is: (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1) .cse0) .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) .cse0) .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-19 21:29:44,613 INFO L268 CegarLoopResult]: For program point L580(lines 580 585) no Hoare annotation was computed. [2020-07-19 21:29:44,613 INFO L264 CegarLoopResult]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse1 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 (not (= 0 ~compRegistered~0)) .cse1))) [2020-07-19 21:29:44,613 INFO L268 CegarLoopResult]: For program point L560-1(lines 552 565) no Hoare annotation was computed. [2020-07-19 21:29:44,613 INFO L268 CegarLoopResult]: For program point L556(lines 556 562) no Hoare annotation was computed. [2020-07-19 21:29:44,614 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 552 565) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= 0 ~compRegistered~0)) .cse1 .cse2) (or .cse0 .cse2 .cse1 (not (<= 1 ~compRegistered~0))))) [2020-07-19 21:29:44,614 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 552 565) no Hoare annotation was computed. [2020-07-19 21:29:44,614 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:29:44,614 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2020-07-19 21:29:44,614 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-19 21:29:44,614 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:29:44,614 INFO L264 CegarLoopResult]: At program point KbFilter_DispatchPassThroughENTRY(lines 663 686) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,615 INFO L268 CegarLoopResult]: For program point L672(lines 672 678) no Hoare annotation was computed. [2020-07-19 21:29:44,615 INFO L264 CegarLoopResult]: At program point L682(line 682) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2020-07-19 21:29:44,615 INFO L268 CegarLoopResult]: For program point L682-1(line 682) no Hoare annotation was computed. [2020-07-19 21:29:44,615 INFO L268 CegarLoopResult]: For program point KbFilter_DispatchPassThroughFINAL(lines 663 686) no Hoare annotation was computed. [2020-07-19 21:29:44,615 INFO L264 CegarLoopResult]: At program point L676(line 676) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-19 21:29:44,615 INFO L268 CegarLoopResult]: For program point KbFilter_DispatchPassThroughEXIT(lines 663 686) no Hoare annotation was computed. [2020-07-19 21:29:44,615 INFO L268 CegarLoopResult]: For program point L676-1(lines 672 678) no Hoare annotation was computed. [2020-07-19 21:29:44,616 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,616 INFO L264 CegarLoopResult]: At program point L192(lines 192 193) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= KbFilter_PnP_~status~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,616 INFO L268 CegarLoopResult]: For program point L225-1(lines 221 227) no Hoare annotation was computed. [2020-07-19 21:29:44,616 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 193) no Hoare annotation was computed. [2020-07-19 21:29:44,616 INFO L268 CegarLoopResult]: For program point L151(lines 151 274) no Hoare annotation was computed. [2020-07-19 21:29:44,616 INFO L268 CegarLoopResult]: For program point L118(lines 118 285) no Hoare annotation was computed. [2020-07-19 21:29:44,616 INFO L264 CegarLoopResult]: At program point L110(lines 109 288) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,616 INFO L271 CegarLoopResult]: At program point L267(lines 170 268) the Hoare annotation is: true [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point L160(lines 160 271) no Hoare annotation was computed. [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point L127(lines 127 282) no Hoare annotation was computed. [2020-07-19 21:29:44,617 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,617 INFO L264 CegarLoopResult]: At program point L169(lines 115 286) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point L136(lines 136 279) no Hoare annotation was computed. [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 79 292) no Hoare annotation was computed. [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point L145(lines 145 276) no Hoare annotation was computed. [2020-07-19 21:29:44,617 INFO L268 CegarLoopResult]: For program point L112(lines 112 287) no Hoare annotation was computed. [2020-07-19 21:29:44,618 INFO L268 CegarLoopResult]: For program point L154(lines 154 273) no Hoare annotation was computed. [2020-07-19 21:29:44,618 INFO L268 CegarLoopResult]: For program point L121(lines 121 284) no Hoare annotation was computed. [2020-07-19 21:29:44,618 INFO L264 CegarLoopResult]: At program point L113(lines 112 287) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,618 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 79 292) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,618 INFO L268 CegarLoopResult]: For program point L237(lines 237 243) no Hoare annotation was computed. [2020-07-19 21:29:44,618 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 79 292) no Hoare annotation was computed. [2020-07-19 21:29:44,618 INFO L264 CegarLoopResult]: At program point L262(lines 262 263) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,618 INFO L268 CegarLoopResult]: For program point L262-1(lines 262 263) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L163(lines 163 270) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L130(lines 130 281) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L221(lines 221 227) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L180(lines 180 186) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L180-1(lines 175 187) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L205(lines 205 211) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L139(lines 139 278) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L106(lines 106 289) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L197(lines 197 203) no Hoare annotation was computed. [2020-07-19 21:29:44,619 INFO L268 CegarLoopResult]: For program point L197-2(lines 170 266) no Hoare annotation was computed. [2020-07-19 21:29:44,620 INFO L264 CegarLoopResult]: At program point L247(line 247) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,620 INFO L268 CegarLoopResult]: For program point L247-1(line 247) no Hoare annotation was computed. [2020-07-19 21:29:44,620 INFO L268 CegarLoopResult]: For program point L148(lines 148 275) no Hoare annotation was computed. [2020-07-19 21:29:44,620 INFO L268 CegarLoopResult]: For program point L115(lines 115 286) no Hoare annotation was computed. [2020-07-19 21:29:44,620 INFO L268 CegarLoopResult]: For program point L206(lines 206 210) no Hoare annotation was computed. [2020-07-19 21:29:44,620 INFO L264 CegarLoopResult]: At program point L107(lines 106 289) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= KbFilter_PnP_~status~0 0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,620 INFO L264 CegarLoopResult]: At program point L231(lines 231 232) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,621 INFO L268 CegarLoopResult]: For program point L231-1(lines 231 232) no Hoare annotation was computed. [2020-07-19 21:29:44,621 INFO L264 CegarLoopResult]: At program point L256(line 256) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,621 INFO L268 CegarLoopResult]: For program point L256-1(lines 252 258) no Hoare annotation was computed. [2020-07-19 21:29:44,621 INFO L268 CegarLoopResult]: For program point L157(lines 157 272) no Hoare annotation was computed. [2020-07-19 21:29:44,621 INFO L268 CegarLoopResult]: For program point L124(lines 124 283) no Hoare annotation was computed. [2020-07-19 21:29:44,621 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,621 INFO L264 CegarLoopResult]: At program point L199(lines 199 201) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (and (= 259 KbFilter_PnP_~__cil_tmp23~0) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1) .cse0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) .cse0))) [2020-07-19 21:29:44,621 INFO L268 CegarLoopResult]: For program point L166(lines 166 269) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L199-1(lines 199 201) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L133(lines 133 280) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) [2020-07-19 21:29:44,622 INFO L264 CegarLoopResult]: At program point L241(line 241) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L241-1(lines 237 243) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L175(lines 175 187) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L142(lines 142 277) no Hoare annotation was computed. [2020-07-19 21:29:44,622 INFO L268 CegarLoopResult]: For program point L109(lines 109 288) no Hoare annotation was computed. [2020-07-19 21:29:44,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:29:44 BoogieIcfgContainer [2020-07-19 21:29:44,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:29:44,667 INFO L168 Benchmark]: Toolchain (without parser) took 20549.96 ms. Allocated memory was 140.0 MB in the beginning and 490.2 MB in the end (delta: 350.2 MB). Free memory was 103.5 MB in the beginning and 312.0 MB in the end (delta: -208.5 MB). Peak memory consumption was 340.3 MB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,668 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.23 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 103.3 MB in the beginning and 175.9 MB in the end (delta: -72.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,669 INFO L168 Benchmark]: Boogie Preprocessor took 68.45 ms. Allocated memory is still 202.4 MB. Free memory was 175.9 MB in the beginning and 172.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,670 INFO L168 Benchmark]: RCFGBuilder took 895.77 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 101.3 MB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,670 INFO L168 Benchmark]: TraceAbstraction took 18950.19 ms. Allocated memory was 202.4 MB in the beginning and 490.2 MB in the end (delta: 287.8 MB). Free memory was 100.7 MB in the beginning and 312.0 MB in the end (delta: -211.3 MB). Peak memory consumption was 275.1 MB. Max. memory is 7.1 GB. [2020-07-19 21:29:44,673 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.17 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 630.23 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 103.3 MB in the beginning and 175.9 MB in the end (delta: -72.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.45 ms. Allocated memory is still 202.4 MB. Free memory was 175.9 MB in the beginning and 172.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 895.77 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 101.3 MB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18950.19 ms. Allocated memory was 202.4 MB in the beginning and 490.2 MB in the end (delta: 287.8 MB). Free memory was 100.7 MB in the beginning and 312.0 MB in the end (delta: -211.3 MB). Peak memory consumption was 275.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: 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: 420]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || 0 <= status) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) && (((((((!(1 <= NP) || !(NP + 4 <= MPR1)) || 1 == pended) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || !(NP == \old(s))) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((setEventCalled == \old(setEventCalled) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) || 1 == pended) || !(0 == compRegistered)) || !(NP == \old(s)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || (((0 <= returnVal2 && MPR1 == s) && returnVal2 <= 0) && 0 == __cil_tmp7 + 1073741802)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || ((returnVal2 + 1073741823 <= 0 && MPR1 == s) && 0 == __cil_tmp7 + 1073741802)) || ((((MPR1 == s && 259 <= returnVal2) && 0 == __cil_tmp7 + 1073741802) && setEventCalled == 1) && returnVal2 <= 259)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((s == NP || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((s == NP || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || (((((((1 <= NP && NP <= 1) && s == NP) && NP + 5 <= MPR3) && 0 <= status) && !(1 == pended)) && 0 == compRegistered) && NP + 4 <= MPR1) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || ((((((status == 0 && \old(compRegistered) == compRegistered) && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((setEventCalled == \old(setEventCalled) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) || 1 == pended) || !(0 == compRegistered)) || !(NP == \old(s)) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: (((((!(NP + 4 <= MPR1) || ((setEventCalled == \old(setEventCalled) && s == \old(s)) && \old(customIrp) == customIrp)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && setEventCalled == 1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) && (((((((!(1 <= NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2605 SDtfs, 3356 SDslu, 3180 SDs, 0 SdLazy, 4898 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 145 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 324 PreInvPairs, 398 NumberOfFragments, 3099 HoareAnnotationTreeSize, 324 FomulaSimplifications, 504 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 84 FomulaSimplificationsInter, 3632 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 210010 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...