/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.5 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 06:48:50,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 06:48:50,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 06:48:50,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 06:48:50,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 06:48:50,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 06:48:50,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 06:48:50,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 06:48:50,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 06:48:50,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 06:48:50,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 06:48:50,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 06:48:50,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 06:48:50,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 06:48:50,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 06:48:50,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 06:48:50,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 06:48:50,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 06:48:50,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 06:48:50,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 06:48:50,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 06:48:50,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 06:48:50,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 06:48:50,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 06:48:50,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 06:48:50,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 06:48:50,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 06:48:50,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 06:48:50,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 06:48:50,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 06:48:50,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 06:48:50,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 06:48:50,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 06:48:50,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 06:48:50,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 06:48:50,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 06:48:50,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 06:48:50,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 06:48:50,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 06:48:50,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 06:48:50,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 06:48:50,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 06:48:50,599 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 06:48:50,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 06:48:50,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 06:48:50,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 06:48:50,601 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 06:48:50,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 06:48:50,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 06:48:50,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 06:48:50,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 06:48:50,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 06:48:50,603 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 06:48:50,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 06:48:50,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 06:48:50,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 06:48:50,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 06:48:50,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 06:48:50,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 06:48:50,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 06:48:50,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 06:48:50,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 06:48:50,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 06:48:50,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 06:48:50,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 06:48:50,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 06:48:50,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; [2020-08-19 06:48:50,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 06:48:50,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 06:48:50,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 06:48:50,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 06:48:50,969 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 06:48:50,970 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-19 06:48:51,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b040c3fd/3b427227e0d846e0818563cba24bb650/FLAG3f2b1ce74 [2020-08-19 06:48:51,570 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 06:48:51,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-19 06:48:51,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b040c3fd/3b427227e0d846e0818563cba24bb650/FLAG3f2b1ce74 [2020-08-19 06:48:51,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b040c3fd/3b427227e0d846e0818563cba24bb650 [2020-08-19 06:48:51,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 06:48:51,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 06:48:51,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 06:48:51,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 06:48:51,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 06:48:51,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:48:51" (1/1) ... [2020-08-19 06:48:51,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68717dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:51, skipping insertion in model container [2020-08-19 06:48:51,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:48:51" (1/1) ... [2020-08-19 06:48:51,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 06:48:52,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 06:48:52,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:48:52,242 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 06:48:52,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:48:52,410 INFO L208 MainTranslator]: Completed translation [2020-08-19 06:48:52,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52 WrapperNode [2020-08-19 06:48:52,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 06:48:52,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 06:48:52,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 06:48:52,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 06:48:52,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... [2020-08-19 06:48:52,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 06:48:52,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 06:48:52,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 06:48:52,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 06:48:52,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 06:48:52,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 06:48:52,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 06:48:52,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-19 06:48:52,540 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-19 06:48:52,540 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-19 06:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-19 06:48:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-19 06:48:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-19 06:48:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 06:48:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-19 06:48:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 06:48:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-19 06:48:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-19 06:48:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 06:48:52,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 06:48:52,786 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-19 06:48:52,937 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-19 06:48:52,937 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-19 06:48:52,940 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-19 06:48:52,986 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-19 06:48:52,986 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-19 06:48:53,000 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-19 06:48:53,020 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-19 06:48:53,021 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-19 06:48:53,034 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-19 06:48:53,211 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-19 06:48:53,211 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-19 06:48:53,235 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 06:48:53,235 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 06:48:53,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:48:53 BoogieIcfgContainer [2020-08-19 06:48:53,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 06:48:53,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 06:48:53,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 06:48:53,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 06:48:53,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 06:48:51" (1/3) ... [2020-08-19 06:48:53,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b9d4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:48:53, skipping insertion in model container [2020-08-19 06:48:53,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:48:52" (2/3) ... [2020-08-19 06:48:53,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b9d4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:48:53, skipping insertion in model container [2020-08-19 06:48:53,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:48:53" (3/3) ... [2020-08-19 06:48:53,257 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-19 06:48:53,266 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 06:48:53,274 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 06:48:53,289 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 06:48:53,315 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 06:48:53,315 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 06:48:53,315 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 06:48:53,316 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 06:48:53,316 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 06:48:53,316 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 06:48:53,316 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 06:48:53,316 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 06:48:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-19 06:48:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-19 06:48:53,346 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:53,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:53,347 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-19 06:48:53,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:53,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180578553] [2020-08-19 06:48:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:53,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:53,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:53,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180578553] [2020-08-19 06:48:53,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:53,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 06:48:53,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273719585] [2020-08-19 06:48:53,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 06:48:53,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 06:48:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:48:53,798 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-19 06:48:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:54,466 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-19 06:48:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-19 06:48:54,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-19 06:48:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:54,483 INFO L225 Difference]: With dead ends: 303 [2020-08-19 06:48:54,484 INFO L226 Difference]: Without dead ends: 157 [2020-08-19 06:48:54,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:48:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-19 06:48:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-19 06:48:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-19 06:48:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-19 06:48:54,567 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-19 06:48:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:54,569 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-19 06:48:54,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 06:48:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-19 06:48:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 06:48:54,572 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:54,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:54,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 06:48:54,573 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-19 06:48:54,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:54,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1473739776] [2020-08-19 06:48:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:54,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:54,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:54,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:54,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1473739776] [2020-08-19 06:48:54,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:54,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-19 06:48:54,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326977191] [2020-08-19 06:48:54,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:48:54,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:48:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:48:54,974 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-19 06:48:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:55,810 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-19 06:48:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:48:55,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 06:48:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:55,814 INFO L225 Difference]: With dead ends: 275 [2020-08-19 06:48:55,815 INFO L226 Difference]: Without dead ends: 219 [2020-08-19 06:48:55,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:48:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-19 06:48:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-19 06:48:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-19 06:48:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-19 06:48:55,852 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-19 06:48:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:55,853 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-19 06:48:55,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:48:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-19 06:48:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 06:48:55,854 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:55,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:55,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 06:48:55,855 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-19 06:48:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:55,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594110521] [2020-08-19 06:48:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:55,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:56,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594110521] [2020-08-19 06:48:56,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:56,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-19 06:48:56,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107790542] [2020-08-19 06:48:56,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:48:56,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:48:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:48:56,042 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-19 06:48:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:56,476 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-19 06:48:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:48:56,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 06:48:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:56,481 INFO L225 Difference]: With dead ends: 316 [2020-08-19 06:48:56,481 INFO L226 Difference]: Without dead ends: 254 [2020-08-19 06:48:56,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:48:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-19 06:48:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-19 06:48:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-19 06:48:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-19 06:48:56,563 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-19 06:48:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:56,564 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-19 06:48:56,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:48:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-19 06:48:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 06:48:56,566 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:56,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:56,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 06:48:56,567 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-19 06:48:56,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:56,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [354484966] [2020-08-19 06:48:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:56,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [354484966] [2020-08-19 06:48:56,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:56,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-19 06:48:56,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809194476] [2020-08-19 06:48:56,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:48:56,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:56,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:48:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:48:56,723 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-19 06:48:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:57,207 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-19 06:48:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:48:57,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-19 06:48:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:57,210 INFO L225 Difference]: With dead ends: 220 [2020-08-19 06:48:57,210 INFO L226 Difference]: Without dead ends: 217 [2020-08-19 06:48:57,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:48:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-19 06:48:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-19 06:48:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-19 06:48:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-19 06:48:57,232 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-19 06:48:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:57,233 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-19 06:48:57,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:48:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-19 06:48:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-19 06:48:57,235 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:57,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:57,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 06:48:57,236 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-19 06:48:57,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:57,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694800694] [2020-08-19 06:48:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:57,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:57,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:57,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:48:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:57,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694800694] [2020-08-19 06:48:57,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:57,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-19 06:48:57,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049129602] [2020-08-19 06:48:57,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 06:48:57,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 06:48:57,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:48:57,470 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-19 06:48:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:58,168 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-19 06:48:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 06:48:58,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-19 06:48:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:58,178 INFO L225 Difference]: With dead ends: 274 [2020-08-19 06:48:58,178 INFO L226 Difference]: Without dead ends: 208 [2020-08-19 06:48:58,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:48:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-19 06:48:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-19 06:48:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-19 06:48:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-19 06:48:58,210 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-19 06:48:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:58,210 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-19 06:48:58,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 06:48:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-19 06:48:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-19 06:48:58,215 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:58,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:58,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 06:48:58,215 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-19 06:48:58,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:58,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365086234] [2020-08-19 06:48:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 06:48:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:48:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-19 06:48:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:58,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [365086234] [2020-08-19 06:48:58,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:58,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-19 06:48:58,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501968830] [2020-08-19 06:48:58,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 06:48:58,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 06:48:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:48:58,410 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-19 06:48:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:48:58,893 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-19 06:48:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 06:48:58,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-19 06:48:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:48:58,895 INFO L225 Difference]: With dead ends: 258 [2020-08-19 06:48:58,896 INFO L226 Difference]: Without dead ends: 197 [2020-08-19 06:48:58,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:48:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-19 06:48:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-19 06:48:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-19 06:48:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-19 06:48:58,914 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-19 06:48:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:48:58,915 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-19 06:48:58,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 06:48:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-19 06:48:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-19 06:48:58,916 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:48:58,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:48:58,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 06:48:58,917 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:48:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:48:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-19 06:48:58,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:48:58,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356033298] [2020-08-19 06:48:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:48:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:48:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:48:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 06:48:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:48:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:48:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:48:59,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356033298] [2020-08-19 06:48:59,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:48:59,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 06:48:59,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986612435] [2020-08-19 06:48:59,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 06:48:59,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:48:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 06:48:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:48:59,186 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-19 06:49:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:00,099 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-19 06:49:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:49:00,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-19 06:49:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:00,104 INFO L225 Difference]: With dead ends: 243 [2020-08-19 06:49:00,104 INFO L226 Difference]: Without dead ends: 238 [2020-08-19 06:49:00,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-19 06:49:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-19 06:49:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-19 06:49:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-19 06:49:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-19 06:49:00,131 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-19 06:49:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:00,133 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-19 06:49:00,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 06:49:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-19 06:49:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-19 06:49:00,135 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:00,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:00,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 06:49:00,138 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-19 06:49:00,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:00,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663515770] [2020-08-19 06:49:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 06:49:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:00,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663515770] [2020-08-19 06:49:00,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:00,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-19 06:49:00,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350686731] [2020-08-19 06:49:00,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 06:49:00,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 06:49:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-19 06:49:00,462 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-19 06:49:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:01,755 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-19 06:49:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 06:49:01,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-19 06:49:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:01,759 INFO L225 Difference]: With dead ends: 246 [2020-08-19 06:49:01,759 INFO L226 Difference]: Without dead ends: 222 [2020-08-19 06:49:01,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-19 06:49:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-19 06:49:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-19 06:49:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-19 06:49:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-19 06:49:01,780 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-19 06:49:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:01,780 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-19 06:49:01,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 06:49:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-19 06:49:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-19 06:49:01,782 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:01,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:01,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 06:49:01,782 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-19 06:49:01,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:01,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30482572] [2020-08-19 06:49:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 06:49:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:01,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30482572] [2020-08-19 06:49:01,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:01,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-19 06:49:01,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368270119] [2020-08-19 06:49:01,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 06:49:01,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 06:49:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:49:01,983 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-19 06:49:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:02,176 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-19 06:49:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 06:49:02,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-19 06:49:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:02,177 INFO L225 Difference]: With dead ends: 203 [2020-08-19 06:49:02,177 INFO L226 Difference]: Without dead ends: 91 [2020-08-19 06:49:02,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:49:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-19 06:49:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-19 06:49:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-19 06:49:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-19 06:49:02,187 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-19 06:49:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:02,187 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-19 06:49:02,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 06:49:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-19 06:49:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-19 06:49:02,188 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:02,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:02,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 06:49:02,189 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-19 06:49:02,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:02,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716996998] [2020-08-19 06:49:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:02,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [716996998] [2020-08-19 06:49:02,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:02,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-19 06:49:02,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688418285] [2020-08-19 06:49:02,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 06:49:02,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 06:49:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:49:02,412 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-19 06:49:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:02,896 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-19 06:49:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 06:49:02,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-19 06:49:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:02,897 INFO L225 Difference]: With dead ends: 119 [2020-08-19 06:49:02,897 INFO L226 Difference]: Without dead ends: 91 [2020-08-19 06:49:02,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-19 06:49:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-19 06:49:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-19 06:49:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-19 06:49:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-19 06:49:02,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-19 06:49:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:02,911 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-19 06:49:02,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 06:49:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-19 06:49:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 06:49:02,912 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:02,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:02,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 06:49:02,913 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-19 06:49:02,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:02,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515701971] [2020-08-19 06:49:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:03,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515701971] [2020-08-19 06:49:03,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:03,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 06:49:03,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997591362] [2020-08-19 06:49:03,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 06:49:03,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 06:49:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-19 06:49:03,147 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-19 06:49:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:03,334 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-19 06:49:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 06:49:03,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-19 06:49:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:03,336 INFO L225 Difference]: With dead ends: 122 [2020-08-19 06:49:03,336 INFO L226 Difference]: Without dead ends: 94 [2020-08-19 06:49:03,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-19 06:49:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-19 06:49:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-19 06:49:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-19 06:49:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-19 06:49:03,346 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-19 06:49:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:03,347 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-19 06:49:03,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 06:49:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-19 06:49:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 06:49:03,348 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:03,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:03,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 06:49:03,349 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-19 06:49:03,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:03,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476013552] [2020-08-19 06:49:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:03,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476013552] [2020-08-19 06:49:03,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:03,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-19 06:49:03,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733413616] [2020-08-19 06:49:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 06:49:03,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 06:49:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-19 06:49:03,585 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-19 06:49:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:03,905 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-19 06:49:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:49:03,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-19 06:49:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:03,908 INFO L225 Difference]: With dead ends: 112 [2020-08-19 06:49:03,908 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 06:49:03,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:49:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 06:49:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-19 06:49:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-19 06:49:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-19 06:49:03,919 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-19 06:49:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:03,920 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-19 06:49:03,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 06:49:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-19 06:49:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-19 06:49:03,921 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:03,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:03,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 06:49:03,921 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-19 06:49:03,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:03,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274792114] [2020-08-19 06:49:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:03,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:04,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274792114] [2020-08-19 06:49:04,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:04,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 06:49:04,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991525007] [2020-08-19 06:49:04,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 06:49:04,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 06:49:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-19 06:49:04,111 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-19 06:49:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:04,341 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-19 06:49:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 06:49:04,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-19 06:49:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:04,343 INFO L225 Difference]: With dead ends: 105 [2020-08-19 06:49:04,343 INFO L226 Difference]: Without dead ends: 100 [2020-08-19 06:49:04,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:49:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-19 06:49:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-19 06:49:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-19 06:49:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-19 06:49:04,354 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-19 06:49:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:04,355 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-19 06:49:04,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 06:49:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-19 06:49:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-19 06:49:04,356 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:04,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:04,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 06:49:04,356 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-19 06:49:04,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:04,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851418729] [2020-08-19 06:49:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:04,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851418729] [2020-08-19 06:49:04,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:04,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-19 06:49:04,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313782934] [2020-08-19 06:49:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 06:49:04,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 06:49:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-19 06:49:04,609 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-19 06:49:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:04,882 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-19 06:49:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:49:04,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-19 06:49:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:04,884 INFO L225 Difference]: With dead ends: 98 [2020-08-19 06:49:04,884 INFO L226 Difference]: Without dead ends: 91 [2020-08-19 06:49:04,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:49:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-19 06:49:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-19 06:49:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-19 06:49:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-19 06:49:04,896 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-19 06:49:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:04,896 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-19 06:49:04,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 06:49:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-19 06:49:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-19 06:49:04,897 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:04,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:04,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 06:49:04,898 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:04,898 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-19 06:49:04,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:04,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341333130] [2020-08-19 06:49:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:05,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341333130] [2020-08-19 06:49:05,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 06:49:05,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518433256] [2020-08-19 06:49:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 06:49:05,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 06:49:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:49:05,205 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-19 06:49:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:05,494 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-19 06:49:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:49:05,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-19 06:49:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:05,496 INFO L225 Difference]: With dead ends: 107 [2020-08-19 06:49:05,496 INFO L226 Difference]: Without dead ends: 76 [2020-08-19 06:49:05,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-08-19 06:49:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-19 06:49:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-19 06:49:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-19 06:49:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-19 06:49:05,510 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-19 06:49:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:05,511 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-19 06:49:05,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 06:49:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-19 06:49:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-19 06:49:05,512 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:05,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:05,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 06:49:05,512 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:05,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-19 06:49:05,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:05,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213248900] [2020-08-19 06:49:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:05,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213248900] [2020-08-19 06:49:05,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:05,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 06:49:05,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715675959] [2020-08-19 06:49:05,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 06:49:05,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:05,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 06:49:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-19 06:49:05,725 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-19 06:49:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:05,992 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-19 06:49:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 06:49:05,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-19 06:49:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:05,994 INFO L225 Difference]: With dead ends: 141 [2020-08-19 06:49:05,994 INFO L226 Difference]: Without dead ends: 134 [2020-08-19 06:49:05,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:49:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-19 06:49:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-19 06:49:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-19 06:49:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-19 06:49:06,016 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-19 06:49:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:06,016 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-19 06:49:06,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 06:49:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-19 06:49:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-19 06:49:06,018 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:06,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:06,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 06:49:06,018 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-19 06:49:06,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:06,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511780664] [2020-08-19 06:49:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:06,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511780664] [2020-08-19 06:49:06,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:06,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-19 06:49:06,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938114446] [2020-08-19 06:49:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 06:49:06,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 06:49:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-19 06:49:06,300 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-19 06:49:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:06,606 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-19 06:49:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:49:06,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-19 06:49:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:06,608 INFO L225 Difference]: With dead ends: 144 [2020-08-19 06:49:06,608 INFO L226 Difference]: Without dead ends: 133 [2020-08-19 06:49:06,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:49:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-19 06:49:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-19 06:49:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-19 06:49:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-19 06:49:06,633 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-19 06:49:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:06,634 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-19 06:49:06,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 06:49:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-19 06:49:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-19 06:49:06,636 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:49:06,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:49:06,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 06:49:06,637 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:49:06,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:49:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-19 06:49:06,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:49:06,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [143430083] [2020-08-19 06:49:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:49:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:49:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 06:49:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-19 06:49:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 06:49:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 06:49:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 06:49:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-19 06:49:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:49:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:49:06,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [143430083] [2020-08-19 06:49:06,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:49:06,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-19 06:49:06,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896728523] [2020-08-19 06:49:06,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 06:49:06,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:49:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 06:49:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:49:06,904 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-19 06:49:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:49:07,163 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-19 06:49:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 06:49:07,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-19 06:49:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:49:07,165 INFO L225 Difference]: With dead ends: 133 [2020-08-19 06:49:07,165 INFO L226 Difference]: Without dead ends: 0 [2020-08-19 06:49:07,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:49:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-19 06:49:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-19 06:49:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-19 06:49:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-19 06:49:07,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-19 06:49:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:49:07,169 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-19 06:49:07,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 06:49:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-19 06:49:07,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-19 06:49:07,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-19 06:49:07,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-19 06:49:08,352 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-19 06:49:08,584 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-19 06:49:08,963 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-19 06:49:09,292 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-19 06:49:09,481 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-08-19 06:49:09,739 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-19 06:49:09,947 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-19 06:49:10,223 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-19 06:49:10,589 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-19 06:49:10,771 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-19 06:49:11,020 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-19 06:49:11,205 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-19 06:49:11,346 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-19 06:49:11,745 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-19 06:49:11,930 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-19 06:49:12,069 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-19 06:49:12,223 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-19 06:49:12,347 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-19 06:49:12,624 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-19 06:49:12,812 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-19 06:49:13,070 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-19 06:49:13,366 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-19 06:49:13,516 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-19 06:49:13,685 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-08-19 06:49:13,791 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-08-19 06:49:13,934 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-19 06:49:13,986 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-19 06:49:13,987 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-19 06:49:13,987 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-19 06:49:13,987 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-19 06:49:13,987 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-19 06:49:13,987 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-19 06:49:13,988 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-19 06:49:13,988 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-19 06:49:13,988 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-19 06:49:13,988 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,988 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-19 06:49:13,988 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-19 06:49:13,989 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,989 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-19 06:49:13,989 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-19 06:49:13,989 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-19 06:49:13,989 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-19 06:49:13,989 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-19 06:49:13,990 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,990 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-19 06:49:13,990 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-19 06:49:13,990 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,990 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-19 06:49:13,990 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-19 06:49:13,990 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-19 06:49:13,991 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,991 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-19 06:49:13,992 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,992 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-19 06:49:13,992 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,992 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-19 06:49:13,992 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,993 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-19 06:49:13,993 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-19 06:49:13,993 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,993 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-19 06:49:13,993 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-19 06:49:13,993 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-19 06:49:13,993 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,994 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-19 06:49:13,994 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-19 06:49:13,994 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-19 06:49:13,994 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-19 06:49:13,994 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-19 06:49:13,994 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-08-19 06:49:13,995 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-19 06:49:13,995 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-19 06:49:13,995 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-19 06:49:13,995 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-19 06:49:13,995 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-19 06:49:13,996 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-19 06:49:13,996 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-19 06:49:13,996 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-19 06:49:13,996 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-19 06:49:13,996 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-19 06:49:13,996 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-19 06:49:13,997 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-19 06:49:13,997 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-19 06:49:13,997 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-19 06:49:13,997 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-19 06:49:13,997 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:13,997 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-19 06:49:13,998 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:13,998 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-19 06:49:13,998 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-19 06:49:13,998 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-08-19 06:49:13,998 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-19 06:49:13,998 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-08-19 06:49:13,998 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-19 06:49:13,999 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-08-19 06:49:13,999 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-19 06:49:14,000 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-19 06:49:14,000 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-08-19 06:49:14,000 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-19 06:49:14,000 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-08-19 06:49:14,001 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-19 06:49:14,001 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-08-19 06:49:14,001 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-19 06:49:14,001 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-19 06:49:14,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-19 06:49:14,001 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-08-19 06:49:14,001 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-19 06:49:14,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-19 06:49:14,002 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-08-19 06:49:14,002 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-19 06:49:14,002 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-19 06:49:14,002 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-19 06:49:14,002 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,002 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,002 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-19 06:49:14,003 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,003 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-19 06:49:14,003 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-19 06:49:14,004 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,004 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-19 06:49:14,005 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-19 06:49:14,005 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,005 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,005 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-19 06:49:14,005 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,005 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-19 06:49:14,005 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-19 06:49:14,006 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-19 06:49:14,007 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-19 06:49:14,008 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-19 06:49:14,009 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-19 06:49:14,009 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-19 06:49:14,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 06:49:14 BoogieIcfgContainer [2020-08-19 06:49:14,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 06:49:14,047 INFO L168 Benchmark]: Toolchain (without parser) took 22128.02 ms. Allocated memory was 141.0 MB in the beginning and 487.6 MB in the end (delta: 346.6 MB). Free memory was 103.6 MB in the beginning and 178.5 MB in the end (delta: -75.0 MB). Peak memory consumption was 334.3 MB. Max. memory is 7.1 GB. [2020-08-19 06:49:14,048 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 06:49:14,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.70 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.3 MB in the beginning and 178.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-08-19 06:49:14,049 INFO L168 Benchmark]: Boogie Preprocessor took 51.37 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-08-19 06:49:14,049 INFO L168 Benchmark]: RCFGBuilder took 781.90 ms. Allocated memory is still 203.4 MB. Free memory was 176.7 MB in the beginning and 131.1 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2020-08-19 06:49:14,050 INFO L168 Benchmark]: TraceAbstraction took 20796.41 ms. Allocated memory was 203.4 MB in the beginning and 487.6 MB in the end (delta: 284.2 MB). Free memory was 130.4 MB in the beginning and 178.5 MB in the end (delta: -48.1 MB). Peak memory consumption was 298.8 MB. Max. memory is 7.1 GB. [2020-08-19 06:49:14,053 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 490.70 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.3 MB in the beginning and 178.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.37 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.90 ms. Allocated memory is still 203.4 MB. Free memory was 176.7 MB in the beginning and 131.1 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20796.41 ms. Allocated memory was 203.4 MB in the beginning and 487.6 MB in the end (delta: 284.2 MB). Free memory was 130.4 MB in the beginning and 178.5 MB in the end (delta: -48.1 MB). Peak memory consumption was 298.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...