/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:22:07,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:22:07,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:22:07,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:22:07,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:22:07,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:22:07,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:22:07,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:22:07,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:22:07,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:22:07,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:22:07,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:22:07,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:22:07,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:22:07,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:22:07,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:22:07,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:22:07,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:22:07,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:22:07,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:22:07,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:22:07,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:22:07,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:22:07,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:22:07,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:22:07,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:22:07,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:22:07,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:22:07,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:22:07,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:22:07,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:22:07,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:22:07,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:22:07,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:22:07,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:22:07,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:22:07,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:22:07,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:22:07,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:22:07,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:22:07,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:22:07,547 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-10-23 18:22:07,574 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:22:07,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:22:07,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:22:07,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:22:07,577 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:22:07,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:22:07,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:22:07,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:22:07,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:22:07,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:22:07,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:22:07,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:22:07,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:22:07,579 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:22:07,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:22:07,579 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:22:07,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:22:07,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:22:07,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:22:07,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:22:07,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:22:07,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:22:07,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:22:07,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:22:07,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:22:07,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:22:07,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:22:07,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:22:07,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:22:07,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:22:07,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:22:07,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:22:07,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:22:07,991 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:22:07,992 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:22:07,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-10-23 18:22:08,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6576b7e6/514a3996f349452dbc3679d49b3e7d34/FLAGf517ab97e [2020-10-23 18:22:08,718 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:22:08,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-10-23 18:22:08,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6576b7e6/514a3996f349452dbc3679d49b3e7d34/FLAGf517ab97e [2020-10-23 18:22:09,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6576b7e6/514a3996f349452dbc3679d49b3e7d34 [2020-10-23 18:22:09,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:22:09,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:22:09,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:22:09,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:22:09,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:22:09,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff49d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09, skipping insertion in model container [2020-10-23 18:22:09,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:22:09,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:22:09,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:22:09,508 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:22:09,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:22:09,613 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:22:09,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09 WrapperNode [2020-10-23 18:22:09,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:22:09,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:22:09,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:22:09,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:22:09,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (1/1) ... [2020-10-23 18:22:09,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:22:09,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:22:09,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:22:09,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:22:09,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (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-10-23 18:22:09,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:22:09,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:22:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-10-23 18:22:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:22:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-10-23 18:22:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-10-23 18:22:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:22:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:22:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:22:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:22:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:22:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:22:10,046 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:10,199 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-10-23 18:22:10,199 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-10-23 18:22:10,201 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:10,247 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-10-23 18:22:10,247 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-10-23 18:22:10,288 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:10,313 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-10-23 18:22:10,314 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-10-23 18:22:10,332 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:10,452 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-10-23 18:22:10,452 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-10-23 18:22:10,474 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:22:10,474 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 18:22:10,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:22:10 BoogieIcfgContainer [2020-10-23 18:22:10,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:22:10,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:22:10,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:22:10,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:22:10,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:22:09" (1/3) ... [2020-10-23 18:22:10,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ed12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:22:10, skipping insertion in model container [2020-10-23 18:22:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:09" (2/3) ... [2020-10-23 18:22:10,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ed12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:22:10, skipping insertion in model container [2020-10-23 18:22:10,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:22:10" (3/3) ... [2020-10-23 18:22:10,495 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-10-23 18:22:10,510 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:22:10,517 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:22:10,536 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:22:10,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:22:10,588 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:22:10,588 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:22:10,588 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:22:10,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:22:10,588 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:22:10,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:22:10,589 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:22:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2020-10-23 18:22:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-23 18:22:10,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:10,618 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] [2020-10-23 18:22:10,618 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -287519802, now seen corresponding path program 1 times [2020-10-23 18:22:10,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:10,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585490498] [2020-10-23 18:22:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:11,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:11,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:11,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585490498] [2020-10-23 18:22:11,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:11,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-23 18:22:11,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197756042] [2020-10-23 18:22:11,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-23 18:22:11,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-23 18:22:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-23 18:22:11,180 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2020-10-23 18:22:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:12,066 INFO L93 Difference]: Finished difference Result 307 states and 468 transitions. [2020-10-23 18:22:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 18:22:12,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-23 18:22:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:12,083 INFO L225 Difference]: With dead ends: 307 [2020-10-23 18:22:12,083 INFO L226 Difference]: Without dead ends: 158 [2020-10-23 18:22:12,089 INFO L677 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-10-23 18:22:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-23 18:22:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-23 18:22:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-23 18:22:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2020-10-23 18:22:12,174 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 21 [2020-10-23 18:22:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:12,175 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2020-10-23 18:22:12,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-23 18:22:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2020-10-23 18:22:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 18:22:12,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:12,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:12,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:22:12,178 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash 161897331, now seen corresponding path program 1 times [2020-10-23 18:22:12,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:12,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077487060] [2020-10-23 18:22:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:12,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077487060] [2020-10-23 18:22:12,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:12,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:22:12,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964935671] [2020-10-23 18:22:12,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:22:12,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:12,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:22:12,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:22:12,491 INFO L87 Difference]: Start difference. First operand 141 states and 191 transitions. Second operand 6 states. [2020-10-23 18:22:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:13,579 INFO L93 Difference]: Finished difference Result 278 states and 373 transitions. [2020-10-23 18:22:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-23 18:22:13,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 18:22:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:13,584 INFO L225 Difference]: With dead ends: 278 [2020-10-23 18:22:13,584 INFO L226 Difference]: Without dead ends: 221 [2020-10-23 18:22:13,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:22:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-23 18:22:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 196. [2020-10-23 18:22:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-23 18:22:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2020-10-23 18:22:13,654 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 27 [2020-10-23 18:22:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:13,654 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2020-10-23 18:22:13,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:22:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2020-10-23 18:22:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-23 18:22:13,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:13,657 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-10-23 18:22:13,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:22:13,658 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 723741620, now seen corresponding path program 1 times [2020-10-23 18:22:13,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:13,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694852919] [2020-10-23 18:22:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:13,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:13,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:13,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:13,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694852919] [2020-10-23 18:22:13,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:13,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:22:13,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271016173] [2020-10-23 18:22:13,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:22:13,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:13,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:22:13,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:22:13,982 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand 6 states. [2020-10-23 18:22:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:14,834 INFO L93 Difference]: Finished difference Result 319 states and 416 transitions. [2020-10-23 18:22:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-23 18:22:14,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-10-23 18:22:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:14,839 INFO L225 Difference]: With dead ends: 319 [2020-10-23 18:22:14,841 INFO L226 Difference]: Without dead ends: 256 [2020-10-23 18:22:14,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:22:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-23 18:22:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 218. [2020-10-23 18:22:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-10-23 18:22:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2020-10-23 18:22:14,892 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 28 [2020-10-23 18:22:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:14,892 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2020-10-23 18:22:14,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:22:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2020-10-23 18:22:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-23 18:22:14,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:14,895 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-10-23 18:22:14,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:22:14,895 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -301257207, now seen corresponding path program 1 times [2020-10-23 18:22:14,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:14,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519427218] [2020-10-23 18:22:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:15,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:15,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:15,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:15,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519427218] [2020-10-23 18:22:15,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:15,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:22:15,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287884238] [2020-10-23 18:22:15,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:22:15,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:22:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:22:15,271 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand 7 states. [2020-10-23 18:22:15,791 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-23 18:22:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:16,486 INFO L93 Difference]: Finished difference Result 222 states and 293 transitions. [2020-10-23 18:22:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:22:16,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-10-23 18:22:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:16,494 INFO L225 Difference]: With dead ends: 222 [2020-10-23 18:22:16,495 INFO L226 Difference]: Without dead ends: 218 [2020-10-23 18:22:16,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-23 18:22:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2020-10-23 18:22:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-10-23 18:22:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2020-10-23 18:22:16,544 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 38 [2020-10-23 18:22:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:16,545 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2020-10-23 18:22:16,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:22:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2020-10-23 18:22:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-23 18:22:16,557 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:16,557 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-10-23 18:22:16,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:22:16,558 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -905173741, now seen corresponding path program 1 times [2020-10-23 18:22:16,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:16,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133173331] [2020-10-23 18:22:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:16,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133173331] [2020-10-23 18:22:16,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:16,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:16,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057936135] [2020-10-23 18:22:16,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:16,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:16,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:16,878 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand 9 states. [2020-10-23 18:22:17,022 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 18:22:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:18,205 INFO L93 Difference]: Finished difference Result 277 states and 359 transitions. [2020-10-23 18:22:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:18,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-10-23 18:22:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:18,208 INFO L225 Difference]: With dead ends: 277 [2020-10-23 18:22:18,209 INFO L226 Difference]: Without dead ends: 210 [2020-10-23 18:22:18,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:22:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-23 18:22:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2020-10-23 18:22:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-23 18:22:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 251 transitions. [2020-10-23 18:22:18,240 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 251 transitions. Word has length 46 [2020-10-23 18:22:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:18,242 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 251 transitions. [2020-10-23 18:22:18,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2020-10-23 18:22:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-23 18:22:18,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:18,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:18,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:22:18,246 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1403671779, now seen corresponding path program 1 times [2020-10-23 18:22:18,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:18,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718279851] [2020-10-23 18:22:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:22:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-23 18:22:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:18,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718279851] [2020-10-23 18:22:18,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:18,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:18,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396418680] [2020-10-23 18:22:18,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:18,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:18,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:18,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:18,568 INFO L87 Difference]: Start difference. First operand 191 states and 251 transitions. Second operand 8 states. [2020-10-23 18:22:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:19,551 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2020-10-23 18:22:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:22:19,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-10-23 18:22:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:19,557 INFO L225 Difference]: With dead ends: 260 [2020-10-23 18:22:19,557 INFO L226 Difference]: Without dead ends: 198 [2020-10-23 18:22:19,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-23 18:22:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2020-10-23 18:22:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-23 18:22:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2020-10-23 18:22:19,583 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 52 [2020-10-23 18:22:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:19,583 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2020-10-23 18:22:19,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2020-10-23 18:22:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-23 18:22:19,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:19,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:19,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:22:19,585 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1321153240, now seen corresponding path program 1 times [2020-10-23 18:22:19,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:19,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337953174] [2020-10-23 18:22:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:22:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:19,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337953174] [2020-10-23 18:22:19,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:19,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:19,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520985537] [2020-10-23 18:22:19,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:19,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:19,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:19,981 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 12 states. [2020-10-23 18:22:20,750 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-10-23 18:22:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:21,553 INFO L93 Difference]: Finished difference Result 237 states and 303 transitions. [2020-10-23 18:22:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:22:21,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2020-10-23 18:22:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:21,557 INFO L225 Difference]: With dead ends: 237 [2020-10-23 18:22:21,557 INFO L226 Difference]: Without dead ends: 212 [2020-10-23 18:22:21,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:22:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-23 18:22:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2020-10-23 18:22:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-23 18:22:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2020-10-23 18:22:21,580 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 51 [2020-10-23 18:22:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:21,580 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2020-10-23 18:22:21,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2020-10-23 18:22:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-23 18:22:21,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:21,582 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-10-23 18:22:21,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:22:21,582 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1176655459, now seen corresponding path program 1 times [2020-10-23 18:22:21,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:21,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588631937] [2020-10-23 18:22:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:22:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:21,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588631937] [2020-10-23 18:22:21,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:21,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:21,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249627615] [2020-10-23 18:22:21,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:21,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:21,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:21,872 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 8 states. [2020-10-23 18:22:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:22,381 INFO L93 Difference]: Finished difference Result 280 states and 363 transitions. [2020-10-23 18:22:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:22:22,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-10-23 18:22:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:22,385 INFO L225 Difference]: With dead ends: 280 [2020-10-23 18:22:22,385 INFO L226 Difference]: Without dead ends: 214 [2020-10-23 18:22:22,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-23 18:22:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2020-10-23 18:22:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-10-23 18:22:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2020-10-23 18:22:22,408 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 53 [2020-10-23 18:22:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:22,409 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2020-10-23 18:22:22,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2020-10-23 18:22:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-23 18:22:22,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:22,410 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-10-23 18:22:22,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:22:22,411 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1429368095, now seen corresponding path program 1 times [2020-10-23 18:22:22,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:22,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923186781] [2020-10-23 18:22:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:22:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:22,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923186781] [2020-10-23 18:22:22,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:22,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:22,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946085966] [2020-10-23 18:22:22,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:22,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:22,833 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand 12 states. [2020-10-23 18:22:23,287 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-10-23 18:22:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:24,343 INFO L93 Difference]: Finished difference Result 227 states and 288 transitions. [2020-10-23 18:22:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:24,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-10-23 18:22:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:24,347 INFO L225 Difference]: With dead ends: 227 [2020-10-23 18:22:24,348 INFO L226 Difference]: Without dead ends: 221 [2020-10-23 18:22:24,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:22:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-23 18:22:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2020-10-23 18:22:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-23 18:22:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 259 transitions. [2020-10-23 18:22:24,379 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 259 transitions. Word has length 53 [2020-10-23 18:22:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:24,379 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 259 transitions. [2020-10-23 18:22:24,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2020-10-23 18:22:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-23 18:22:24,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:24,381 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-10-23 18:22:24,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:22:24,381 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1681877661, now seen corresponding path program 1 times [2020-10-23 18:22:24,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:24,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236831414] [2020-10-23 18:22:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:22:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:24,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236831414] [2020-10-23 18:22:24,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:24,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:22:24,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904018646] [2020-10-23 18:22:24,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:22:24,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:22:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:22:24,672 INFO L87 Difference]: Start difference. First operand 200 states and 259 transitions. Second operand 10 states. [2020-10-23 18:22:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:25,278 INFO L93 Difference]: Finished difference Result 219 states and 281 transitions. [2020-10-23 18:22:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 18:22:25,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2020-10-23 18:22:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:25,280 INFO L225 Difference]: With dead ends: 219 [2020-10-23 18:22:25,280 INFO L226 Difference]: Without dead ends: 95 [2020-10-23 18:22:25,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-23 18:22:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-23 18:22:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-23 18:22:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2020-10-23 18:22:25,294 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 53 [2020-10-23 18:22:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:25,295 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2020-10-23 18:22:25,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:22:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2020-10-23 18:22:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-23 18:22:25,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:25,296 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] [2020-10-23 18:22:25,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:22:25,296 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 827842256, now seen corresponding path program 1 times [2020-10-23 18:22:25,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:25,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142381466] [2020-10-23 18:22:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:25,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142381466] [2020-10-23 18:22:25,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:25,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:25,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73832915] [2020-10-23 18:22:25,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:25,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:25,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:25,681 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 12 states. [2020-10-23 18:22:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:26,454 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2020-10-23 18:22:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:22:26,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2020-10-23 18:22:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:26,456 INFO L225 Difference]: With dead ends: 124 [2020-10-23 18:22:26,456 INFO L226 Difference]: Without dead ends: 95 [2020-10-23 18:22:26,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:22:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-23 18:22:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-23 18:22:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-23 18:22:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2020-10-23 18:22:26,470 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 60 [2020-10-23 18:22:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:26,470 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2020-10-23 18:22:26,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-10-23 18:22:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-23 18:22:26,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:26,471 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-10-23 18:22:26,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:22:26,472 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -233728390, now seen corresponding path program 1 times [2020-10-23 18:22:26,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:26,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140376143] [2020-10-23 18:22:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:26,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140376143] [2020-10-23 18:22:26,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:26,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:26,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188760563] [2020-10-23 18:22:26,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:26,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:26,825 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 12 states. [2020-10-23 18:22:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:27,275 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2020-10-23 18:22:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:27,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-10-23 18:22:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:27,277 INFO L225 Difference]: With dead ends: 114 [2020-10-23 18:22:27,277 INFO L226 Difference]: Without dead ends: 94 [2020-10-23 18:22:27,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-23 18:22:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2020-10-23 18:22:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-23 18:22:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2020-10-23 18:22:27,292 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 62 [2020-10-23 18:22:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:27,294 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2020-10-23 18:22:27,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2020-10-23 18:22:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 18:22:27,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:27,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:27,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:22:27,295 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash 660592135, now seen corresponding path program 1 times [2020-10-23 18:22:27,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:27,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704364178] [2020-10-23 18:22:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:27,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704364178] [2020-10-23 18:22:27,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:27,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:27,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710518861] [2020-10-23 18:22:27,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:27,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:27,663 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 12 states. [2020-10-23 18:22:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:28,024 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2020-10-23 18:22:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:28,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-10-23 18:22:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:28,027 INFO L225 Difference]: With dead ends: 98 [2020-10-23 18:22:28,027 INFO L226 Difference]: Without dead ends: 90 [2020-10-23 18:22:28,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-23 18:22:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-10-23 18:22:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-23 18:22:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2020-10-23 18:22:28,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 63 [2020-10-23 18:22:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:28,047 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2020-10-23 18:22:28,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2020-10-23 18:22:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 18:22:28,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:28,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:28,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 18:22:28,053 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1477695784, now seen corresponding path program 1 times [2020-10-23 18:22:28,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:28,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448784837] [2020-10-23 18:22:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:28,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448784837] [2020-10-23 18:22:28,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:28,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:28,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130133240] [2020-10-23 18:22:28,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:28,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:28,319 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 9 states. [2020-10-23 18:22:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:28,636 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-10-23 18:22:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:28,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-10-23 18:22:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:28,638 INFO L225 Difference]: With dead ends: 108 [2020-10-23 18:22:28,638 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 18:22:28,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:22:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 18:22:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2020-10-23 18:22:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 18:22:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2020-10-23 18:22:28,652 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 63 [2020-10-23 18:22:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:28,653 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2020-10-23 18:22:28,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2020-10-23 18:22:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-23 18:22:28,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:28,654 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-10-23 18:22:28,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 18:22:28,654 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1115430964, now seen corresponding path program 1 times [2020-10-23 18:22:28,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:28,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371399084] [2020-10-23 18:22:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:28,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371399084] [2020-10-23 18:22:28,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:28,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:28,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858933181] [2020-10-23 18:22:28,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:28,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:28,948 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 9 states. [2020-10-23 18:22:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:29,390 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2020-10-23 18:22:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:22:29,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-10-23 18:22:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:29,392 INFO L225 Difference]: With dead ends: 176 [2020-10-23 18:22:29,393 INFO L226 Difference]: Without dead ends: 168 [2020-10-23 18:22:29,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-10-23 18:22:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2020-10-23 18:22:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-23 18:22:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2020-10-23 18:22:29,415 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 64 [2020-10-23 18:22:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:29,415 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2020-10-23 18:22:29,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2020-10-23 18:22:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-23 18:22:29,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:29,416 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-10-23 18:22:29,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 18:22:29,417 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1924777590, now seen corresponding path program 1 times [2020-10-23 18:22:29,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:29,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793050855] [2020-10-23 18:22:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:29,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793050855] [2020-10-23 18:22:29,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:29,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:29,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404776261] [2020-10-23 18:22:29,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:29,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:29,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:29,800 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 12 states. [2020-10-23 18:22:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:30,229 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-10-23 18:22:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:30,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-10-23 18:22:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:30,232 INFO L225 Difference]: With dead ends: 168 [2020-10-23 18:22:30,232 INFO L226 Difference]: Without dead ends: 141 [2020-10-23 18:22:30,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-23 18:22:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-23 18:22:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-23 18:22:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2020-10-23 18:22:30,252 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 64 [2020-10-23 18:22:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:30,252 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2020-10-23 18:22:30,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2020-10-23 18:22:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-23 18:22:30,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:30,254 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-10-23 18:22:30,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 18:22:30,254 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1636423798, now seen corresponding path program 1 times [2020-10-23 18:22:30,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:30,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703374604] [2020-10-23 18:22:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:30,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703374604] [2020-10-23 18:22:30,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:30,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:30,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512222353] [2020-10-23 18:22:30,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:30,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:30,525 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 9 states. [2020-10-23 18:22:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:30,833 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2020-10-23 18:22:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:30,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-10-23 18:22:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:30,835 INFO L225 Difference]: With dead ends: 167 [2020-10-23 18:22:30,835 INFO L226 Difference]: Without dead ends: 134 [2020-10-23 18:22:30,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-23 18:22:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-23 18:22:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-23 18:22:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2020-10-23 18:22:30,854 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 64 [2020-10-23 18:22:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:30,855 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2020-10-23 18:22:30,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2020-10-23 18:22:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-23 18:22:30,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:30,856 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] [2020-10-23 18:22:30,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 18:22:30,857 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1756072874, now seen corresponding path program 1 times [2020-10-23 18:22:30,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:30,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405044389] [2020-10-23 18:22:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:22:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-10-23 18:22:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:31,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405044389] [2020-10-23 18:22:31,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:31,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:22:31,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917770252] [2020-10-23 18:22:31,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:22:31,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:31,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:22:31,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:31,165 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 11 states. [2020-10-23 18:22:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:31,461 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2020-10-23 18:22:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:31,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2020-10-23 18:22:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:31,465 INFO L225 Difference]: With dead ends: 134 [2020-10-23 18:22:31,465 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 18:22:31,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 18:22:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 18:22:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 18:22:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 18:22:31,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2020-10-23 18:22:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:31,467 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 18:22:31,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:22:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 18:22:31,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 18:22:31,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 18:22:31,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 18:22:32,550 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-10-23 18:22:32,736 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-10-23 18:22:33,005 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-10-23 18:22:33,307 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2020-10-23 18:22:33,465 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 27 [2020-10-23 18:22:33,609 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-10-23 18:22:33,779 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2020-10-23 18:22:34,045 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 40 [2020-10-23 18:22:34,641 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-10-23 18:22:34,761 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-10-23 18:22:35,204 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2020-10-23 18:22:35,566 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2020-10-23 18:22:35,683 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-10-23 18:22:36,025 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-10-23 18:22:36,492 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2020-10-23 18:22:36,813 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2020-10-23 18:22:37,177 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2020-10-23 18:22:37,537 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2020-10-23 18:22:37,657 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-10-23 18:22:37,877 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-10-23 18:22:38,151 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-10-23 18:22:38,567 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 51 [2020-10-23 18:22:38,672 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2020-10-23 18:22:39,010 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2020-10-23 18:22:39,290 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-10-23 18:22:39,633 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2020-10-23 18:22:39,829 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-10-23 18:22:40,140 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2020-10-23 18:22:40,293 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-10-23 18:22:40,529 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-10-23 18:22:40,619 INFO L274 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-10-23 18:22:40,620 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 18:22:40,620 INFO L274 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-10-23 18:22:40,620 INFO L274 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-23 18:22:40,620 INFO L270 CegarLoopResult]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:40,621 INFO L274 CegarLoopResult]: For program point KeSetEventFINAL(lines 515 522) no Hoare annotation was computed. [2020-10-23 18:22:40,621 INFO L274 CegarLoopResult]: For program point KeSetEventEXIT(lines 515 522) no Hoare annotation was computed. [2020-10-23 18:22:40,621 INFO L270 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:40,621 INFO L270 CegarLoopResult]: At program point L571(line 571) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:40,622 INFO L274 CegarLoopResult]: For program point L571-1(line 571) no Hoare annotation was computed. [2020-10-23 18:22:40,622 INFO L274 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 565 575) no Hoare annotation was computed. [2020-10-23 18:22:40,622 INFO L274 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 565 575) no Hoare annotation was computed. [2020-10-23 18:22:40,622 INFO L274 CegarLoopResult]: For program point stub_driver_initEXIT(lines 37 50) no Hoare annotation was computed. [2020-10-23 18:22:40,622 INFO L270 CegarLoopResult]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (not (= |old(~pended~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3))) [2020-10-23 18:22:40,623 INFO L274 CegarLoopResult]: For program point stub_driver_initFINAL(lines 37 50) no Hoare annotation was computed. [2020-10-23 18:22:40,623 INFO L274 CegarLoopResult]: For program point _BLAST_initFINAL(lines 51 72) no Hoare annotation was computed. [2020-10-23 18:22:40,623 INFO L270 CegarLoopResult]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,623 INFO L274 CegarLoopResult]: For program point _BLAST_initEXIT(lines 51 72) no Hoare annotation was computed. [2020-10-23 18:22:40,623 INFO L277 CegarLoopResult]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2020-10-23 18:22:40,623 INFO L274 CegarLoopResult]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2020-10-23 18:22:40,623 INFO L274 CegarLoopResult]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2020-10-23 18:22:40,624 INFO L274 CegarLoopResult]: For program point L581(line 581) no Hoare annotation was computed. [2020-10-23 18:22:40,624 INFO L274 CegarLoopResult]: For program point mainEXIT(lines 288 422) no Hoare annotation was computed. [2020-10-23 18:22:40,624 INFO L270 CegarLoopResult]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,624 INFO L274 CegarLoopResult]: For program point L359(line 359) no Hoare annotation was computed. [2020-10-23 18:22:40,624 INFO L270 CegarLoopResult]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-10-23 18:22:40,624 INFO L274 CegarLoopResult]: For program point L409(lines 409 411) no Hoare annotation was computed. [2020-10-23 18:22:40,625 INFO L270 CegarLoopResult]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-10-23 18:22:40,625 INFO L274 CegarLoopResult]: For program point mainFINAL(lines 288 422) no Hoare annotation was computed. [2020-10-23 18:22:40,625 INFO L274 CegarLoopResult]: For program point L385(lines 369 418) no Hoare annotation was computed. [2020-10-23 18:22:40,625 INFO L274 CegarLoopResult]: For program point L352(lines 352 367) no Hoare annotation was computed. [2020-10-23 18:22:40,625 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2020-10-23 18:22:40,625 INFO L274 CegarLoopResult]: For program point L386(lines 386 415) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L270 CegarLoopResult]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (<= 5 ~MPR1~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L378(lines 378 382) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L370(lines 370 374) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L337(lines 323 368) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L387(lines 387 414) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L270 CegarLoopResult]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~MPR3~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= main_~status~1 0))) [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L321-1(lines 297 421) no Hoare annotation was computed. [2020-10-23 18:22:40,626 INFO L274 CegarLoopResult]: For program point L404(lines 404 412) no Hoare annotation was computed. [2020-10-23 18:22:40,627 INFO L270 CegarLoopResult]: At program point L396(lines 387 414) the Hoare annotation is: (or (and (= ~pended~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,627 INFO L274 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2020-10-23 18:22:40,627 INFO L270 CegarLoopResult]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (= main_~status~1 0) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,627 INFO L274 CegarLoopResult]: For program point L405(lines 405 407) no Hoare annotation was computed. [2020-10-23 18:22:40,627 INFO L274 CegarLoopResult]: For program point L389(lines 389 391) no Hoare annotation was computed. [2020-10-23 18:22:40,628 INFO L270 CegarLoopResult]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-10-23 18:22:40,628 INFO L274 CegarLoopResult]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2020-10-23 18:22:40,628 INFO L274 CegarLoopResult]: For program point L398(lines 398 402) no Hoare annotation was computed. [2020-10-23 18:22:40,628 INFO L274 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2020-10-23 18:22:40,628 INFO L270 CegarLoopResult]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:40,628 INFO L270 CegarLoopResult]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~MPR1~0 ~s~0) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-10-23 18:22:40,628 INFO L274 CegarLoopResult]: For program point L445(lines 445 448) no Hoare annotation was computed. [2020-10-23 18:22:40,629 INFO L274 CegarLoopResult]: For program point L445-1(lines 445 448) no Hoare annotation was computed. [2020-10-23 18:22:40,629 INFO L270 CegarLoopResult]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse2 (= ~compRegistered~0 0)) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7) (or (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse2) .cse6 .cse7))) [2020-10-23 18:22:40,629 INFO L274 CegarLoopResult]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2020-10-23 18:22:40,629 INFO L274 CegarLoopResult]: For program point L479(lines 479 496) no Hoare annotation was computed. [2020-10-23 18:22:40,629 INFO L270 CegarLoopResult]: At program point L446(line 446) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-10-23 18:22:40,629 INFO L274 CegarLoopResult]: For program point L446-1(line 446) no Hoare annotation was computed. [2020-10-23 18:22:40,630 INFO L270 CegarLoopResult]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse5 (not (<= ~SKIP1~0 3))) (.cse6 (not (= ~pended~0 0)))) (and (let ((.cse3 (= ~MPR1~0 ~s~0))) (or .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 (and .cse3 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse3) .cse4 .cse5 .cse6)) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse5 .cse6))) [2020-10-23 18:22:40,630 INFO L274 CegarLoopResult]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2020-10-23 18:22:40,630 INFO L270 CegarLoopResult]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-10-23 18:22:40,630 INFO L274 CegarLoopResult]: For program point L488(lines 488 495) no Hoare annotation was computed. [2020-10-23 18:22:40,630 INFO L274 CegarLoopResult]: For program point L451(lines 451 474) no Hoare annotation was computed. [2020-10-23 18:22:40,630 INFO L274 CegarLoopResult]: For program point L480(lines 480 486) no Hoare annotation was computed. [2020-10-23 18:22:40,631 INFO L270 CegarLoopResult]: At program point L447(line 447) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse5))) [2020-10-23 18:22:40,631 INFO L270 CegarLoopResult]: At program point L493(line 493) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-10-23 18:22:40,631 INFO L274 CegarLoopResult]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2020-10-23 18:22:40,631 INFO L274 CegarLoopResult]: For program point L456(lines 456 473) no Hoare annotation was computed. [2020-10-23 18:22:40,631 INFO L270 CegarLoopResult]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~MPR1~0 ~s~0) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-10-23 18:22:40,631 INFO L270 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,631 INFO L274 CegarLoopResult]: For program point L431-1(lines 423 436) no Hoare annotation was computed. [2020-10-23 18:22:40,632 INFO L270 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,632 INFO L274 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 423 436) no Hoare annotation was computed. [2020-10-23 18:22:40,632 INFO L274 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:22:40,632 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~NP~0 |old(~NP~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#valid)| |#valid|) (= ~IPC~0 |old(~IPC~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~DC~0 |old(~DC~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-10-23 18:22:40,632 INFO L274 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:22:40,632 INFO L270 CegarLoopResult]: At program point L543(line 543) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,632 INFO L274 CegarLoopResult]: For program point L541(lines 541 545) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 523 564) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point L529(lines 529 534) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point L550(lines 550 562) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 523 564) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L270 CegarLoopResult]: At program point L536(lines 528 547) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,633 INFO L274 CegarLoopResult]: For program point L528(lines 528 547) no Hoare annotation was computed. [2020-10-23 18:22:40,633 INFO L270 CegarLoopResult]: At program point L553(lines 552 562) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,634 INFO L270 CegarLoopResult]: At program point L551(lines 550 562) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,634 INFO L270 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,634 INFO L270 CegarLoopResult]: At program point L509(line 509) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,634 INFO L274 CegarLoopResult]: For program point L509-1(lines 501 514) no Hoare annotation was computed. [2020-10-23 18:22:40,634 INFO L270 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,634 INFO L274 CegarLoopResult]: For program point L505(lines 505 511) no Hoare annotation was computed. [2020-10-23 18:22:40,634 INFO L274 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 501 514) no Hoare annotation was computed. [2020-10-23 18:22:40,634 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0)) [2020-10-23 18:22:40,635 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 18:22:40,635 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L274 CegarLoopResult]: For program point L192(lines 192 198) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L274 CegarLoopResult]: For program point L159(lines 159 265) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L274 CegarLoopResult]: For program point L126(lines 126 276) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L274 CegarLoopResult]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2020-10-23 18:22:40,635 INFO L270 CegarLoopResult]: At program point L242(line 242) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L242-1(line 242) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L176(lines 176 182) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L201(lines 201 205) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L135(lines 135 273) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L102(lines 102 284) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L270 CegarLoopResult]: At program point L226(lines 226 227) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,636 INFO L274 CegarLoopResult]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2020-10-23 18:22:40,636 INFO L270 CegarLoopResult]: At program point L251(line 251) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,637 INFO L274 CegarLoopResult]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2020-10-23 18:22:40,637 INFO L274 CegarLoopResult]: For program point L144(lines 144 270) no Hoare annotation was computed. [2020-10-23 18:22:40,637 INFO L274 CegarLoopResult]: For program point L111(lines 111 281) no Hoare annotation was computed. [2020-10-23 18:22:40,637 INFO L270 CegarLoopResult]: At program point L103(lines 102 284) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,637 INFO L270 CegarLoopResult]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7) (or (and (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~status~0) (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (not (= ~compRegistered~0 0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-23 18:22:40,637 INFO L274 CegarLoopResult]: For program point L194-1(lines 194 196) no Hoare annotation was computed. [2020-10-23 18:22:40,637 INFO L274 CegarLoopResult]: For program point L153(lines 153 267) no Hoare annotation was computed. [2020-10-23 18:22:40,638 INFO L274 CegarLoopResult]: For program point L120(lines 120 278) no Hoare annotation was computed. [2020-10-23 18:22:40,638 INFO L270 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (and (= ~s~0 ~NP~0) (not (= ~compRegistered~0 0))) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,638 INFO L270 CegarLoopResult]: At program point L178(line 178) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,638 INFO L274 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 75 287) no Hoare annotation was computed. [2020-10-23 18:22:40,638 INFO L270 CegarLoopResult]: At program point L236(line 236) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,638 INFO L274 CegarLoopResult]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2020-10-23 18:22:40,638 INFO L274 CegarLoopResult]: For program point L162(lines 162 264) no Hoare annotation was computed. [2020-10-23 18:22:40,638 INFO L274 CegarLoopResult]: For program point L129(lines 129 275) no Hoare annotation was computed. [2020-10-23 18:22:40,639 INFO L270 CegarLoopResult]: At program point L220(line 220) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,639 INFO L270 CegarLoopResult]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 0)))))) [2020-10-23 18:22:40,639 INFO L274 CegarLoopResult]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2020-10-23 18:22:40,639 INFO L274 CegarLoopResult]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2020-10-23 18:22:40,639 INFO L270 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,639 INFO L274 CegarLoopResult]: For program point L171(lines 171 183) no Hoare annotation was computed. [2020-10-23 18:22:40,639 INFO L274 CegarLoopResult]: For program point L138(lines 138 272) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point L105(lines 105 283) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 75 287) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L277 CegarLoopResult]: At program point L262(lines 166 263) the Hoare annotation is: true [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point L147(lines 147 269) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point L114(lines 114 280) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L270 CegarLoopResult]: At program point L106(lines 105 283) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point L156(lines 156 266) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L274 CegarLoopResult]: For program point L123(lines 123 277) no Hoare annotation was computed. [2020-10-23 18:22:40,640 INFO L270 CegarLoopResult]: At program point L173(line 173) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,641 INFO L270 CegarLoopResult]: At program point L165(lines 111 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L132(lines 132 274) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L141(lines 141 271) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L108(lines 108 282) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L232(lines 232 238) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L270 CegarLoopResult]: At program point L257(lines 257 258) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L216(lines 216 222) no Hoare annotation was computed. [2020-10-23 18:22:40,641 INFO L274 CegarLoopResult]: For program point L150(lines 150 268) no Hoare annotation was computed. [2020-10-23 18:22:40,642 INFO L274 CegarLoopResult]: For program point L117(lines 117 279) no Hoare annotation was computed. [2020-10-23 18:22:40,642 INFO L270 CegarLoopResult]: At program point L109(lines 108 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-10-23 18:22:40,642 INFO L274 CegarLoopResult]: For program point L200(lines 200 206) no Hoare annotation was computed. [2020-10-23 18:22:40,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:22:40 BoogieIcfgContainer [2020-10-23 18:22:40,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:22:40,678 INFO L168 Benchmark]: Toolchain (without parser) took 31582.46 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 126.6 MB in the beginning and 151.3 MB in the end (delta: -24.6 MB). Peak memory consumption was 185.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:40,679 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:22:40,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.41 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 111.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:40,680 INFO L168 Benchmark]: Boogie Preprocessor took 59.83 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 109.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:40,680 INFO L168 Benchmark]: RCFGBuilder took 803.90 ms. Allocated memory is still 151.0 MB. Free memory was 109.2 MB in the beginning and 98.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:40,681 INFO L168 Benchmark]: TraceAbstraction took 30191.91 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 98.1 MB in the beginning and 151.3 MB in the end (delta: -53.2 MB). Peak memory consumption was 156.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:40,683 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 508.41 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 111.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.83 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 109.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 803.90 ms. Allocated memory is still 151.0 MB. Free memory was 109.2 MB in the beginning and 98.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30191.91 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 98.1 MB in the beginning and 151.3 MB in the end (delta: -53.2 MB). Peak memory consumption was 156.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 105]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || (((((((((NP == 1 && pended == 0) && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) && 5 <= MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((MPR1 == s || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((pended == 0 && NP == 1) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) || !(\old(s) == \old(MPR3))) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || s == NP) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || status == 0) || !(\old(s) == \old(NP)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 0 || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((MPR1 == s || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((((((((MPR1 == s && setEventCalled == 1) || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || s == NP) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2255 SDtfs, 3154 SDslu, 2727 SDs, 0 SdLazy, 5811 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred 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, 198 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 305 PreInvPairs, 372 NumberOfFragments, 2525 HoareAnnotationTreeSize, 305 FomulaSimplifications, 9337 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 54 FomulaSimplificationsInter, 6864 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 919 ConstructedInterpolants, 0 QuantifiedInterpolants, 245663 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...