/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:37:45,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:37:45,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:37:45,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:37:45,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:37:45,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:37:45,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:37:45,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:37:45,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:37:45,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:37:45,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:37:45,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:37:45,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:37:45,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:37:45,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:37:45,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:37:45,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:37:45,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:37:45,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:37:45,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:37:45,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:37:45,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:37:45,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:37:45,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:37:45,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:37:45,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:37:45,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:37:45,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:37:45,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:37:45,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:37:45,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:37:45,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:37:45,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:37:45,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:37:45,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:37:45,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:37:45,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:37:45,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:37:45,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:37:45,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:37:45,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:37:45,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:37:45,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:37:45,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:37:45,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:37:45,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:37:45,659 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:37:45,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:37:45,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:37:45,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:37:45,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:37:45,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:37:45,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:37:45,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:37:45,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:37:45,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:37:45,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:37:45,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:37:45,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:37:45,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:37:45,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:37:45,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:37:45,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:37:45,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:45,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:37:45,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:37:45,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:37:45,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:37:45,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:37:45,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:37:45,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:37:45,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:37:46,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:37:46,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:37:46,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:37:46,026 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:37:46,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-07 00:37:46,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dcabdf9/ab7ccff8d9cd4efba145ae425ba2697d/FLAG69c041651 [2019-11-07 00:37:46,556 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:37:46,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-07 00:37:46,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dcabdf9/ab7ccff8d9cd4efba145ae425ba2697d/FLAG69c041651 [2019-11-07 00:37:46,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dcabdf9/ab7ccff8d9cd4efba145ae425ba2697d [2019-11-07 00:37:46,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:37:46,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:37:46,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:46,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:37:46,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:37:46,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:46" (1/1) ... [2019-11-07 00:37:46,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183b6ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:46, skipping insertion in model container [2019-11-07 00:37:46,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:46" (1/1) ... [2019-11-07 00:37:46,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:37:46,970 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:37:47,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:47,366 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:37:47,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:47,561 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:37:47,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47 WrapperNode [2019-11-07 00:37:47,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:47,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:37:47,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:37:47,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:37:47,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:37:47,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:37:47,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:37:47,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:37:47,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:37:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 00:37:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 00:37:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 00:37:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 00:37:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 00:37:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-07 00:37:47,706 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-07 00:37:47,706 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-07 00:37:47,706 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-07 00:37:47,706 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-07 00:37:47,707 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-07 00:37:47,707 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 00:37:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:37:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 00:37:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 00:37:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-07 00:37:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:37:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:37:48,025 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,079 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-07 00:37:48,079 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-07 00:37:48,109 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,247 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-07 00:37:48,247 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-07 00:37:48,248 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,310 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 00:37:48,310 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 00:37:48,324 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,366 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 00:37:48,367 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 00:37:48,462 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,480 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 00:37:48,480 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 00:37:48,503 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,617 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-07 00:37:48,617 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-07 00:37:48,626 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:37:48,626 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:37:48,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:48 BoogieIcfgContainer [2019-11-07 00:37:48,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:37:48,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:37:48,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:37:48,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:37:48,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:37:46" (1/3) ... [2019-11-07 00:37:48,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69198e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:48, skipping insertion in model container [2019-11-07 00:37:48,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47" (2/3) ... [2019-11-07 00:37:48,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69198e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:48, skipping insertion in model container [2019-11-07 00:37:48,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:48" (3/3) ... [2019-11-07 00:37:48,645 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-07 00:37:48,656 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:37:48,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:37:48,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:37:48,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:37:48,732 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:37:48,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:37:48,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:37:48,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:37:48,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:37:48,733 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:37:48,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:37:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-11-07 00:37:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:37:48,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:48,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:48,776 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-11-07 00:37:48,788 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:48,789 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684536693] [2019-11-07 00:37:48,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:49,059 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684536693] [2019-11-07 00:37:49,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:49,060 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:49,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36614812] [2019-11-07 00:37:49,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:49,070 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:49,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,088 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2019-11-07 00:37:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:49,233 INFO L93 Difference]: Finished difference Result 388 states and 582 transitions. [2019-11-07 00:37:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:49,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:37:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:49,254 INFO L225 Difference]: With dead ends: 388 [2019-11-07 00:37:49,255 INFO L226 Difference]: Without dead ends: 228 [2019-11-07 00:37:49,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-07 00:37:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-11-07 00:37:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-07 00:37:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-11-07 00:37:49,334 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-11-07 00:37:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:49,335 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-11-07 00:37:49,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-11-07 00:37:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:37:49,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:49,337 INFO L410 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] [2019-11-07 00:37:49,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:49,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-11-07 00:37:49,338 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:49,338 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575250748] [2019-11-07 00:37:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:49,618 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575250748] [2019-11-07 00:37:49,619 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:49,619 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:49,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261307361] [2019-11-07 00:37:49,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:49,622 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,622 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2019-11-07 00:37:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:49,810 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-11-07 00:37:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:49,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:37:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:49,815 INFO L225 Difference]: With dead ends: 366 [2019-11-07 00:37:49,816 INFO L226 Difference]: Without dead ends: 308 [2019-11-07 00:37:49,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-07 00:37:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2019-11-07 00:37:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-07 00:37:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2019-11-07 00:37:49,854 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2019-11-07 00:37:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:49,855 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2019-11-07 00:37:49,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2019-11-07 00:37:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:37:49,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:49,857 INFO L410 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] [2019-11-07 00:37:49,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-11-07 00:37:49,858 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:49,858 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719469721] [2019-11-07 00:37:49,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:49,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719469721] [2019-11-07 00:37:49,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:49,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:49,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535101465] [2019-11-07 00:37:49,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:49,925 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:49,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,926 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2019-11-07 00:37:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:49,963 INFO L93 Difference]: Finished difference Result 472 states and 628 transitions. [2019-11-07 00:37:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:49,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:37:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:49,967 INFO L225 Difference]: With dead ends: 472 [2019-11-07 00:37:49,967 INFO L226 Difference]: Without dead ends: 356 [2019-11-07 00:37:49,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-07 00:37:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2019-11-07 00:37:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-07 00:37:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2019-11-07 00:37:50,028 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2019-11-07 00:37:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,029 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2019-11-07 00:37:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2019-11-07 00:37:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 00:37:50,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,037 INFO L410 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] [2019-11-07 00:37:50,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-11-07 00:37:50,038 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,039 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858874108] [2019-11-07 00:37:50,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:50,139 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858874108] [2019-11-07 00:37:50,140 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,140 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:50,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587930068] [2019-11-07 00:37:50,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:50,142 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,144 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2019-11-07 00:37:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,239 INFO L93 Difference]: Finished difference Result 338 states and 457 transitions. [2019-11-07 00:37:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-07 00:37:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,244 INFO L225 Difference]: With dead ends: 338 [2019-11-07 00:37:50,244 INFO L226 Difference]: Without dead ends: 334 [2019-11-07 00:37:50,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-07 00:37:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-11-07 00:37:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-07 00:37:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2019-11-07 00:37:50,286 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2019-11-07 00:37:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,287 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2019-11-07 00:37:50,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2019-11-07 00:37:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:50,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,296 INFO L410 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] [2019-11-07 00:37:50,297 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-11-07 00:37:50,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,299 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352414791] [2019-11-07 00:37:50,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:50,404 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352414791] [2019-11-07 00:37:50,404 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,405 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:50,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358143571] [2019-11-07 00:37:50,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:50,407 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:50,408 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2019-11-07 00:37:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,572 INFO L93 Difference]: Finished difference Result 379 states and 501 transitions. [2019-11-07 00:37:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:50,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-07 00:37:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,575 INFO L225 Difference]: With dead ends: 379 [2019-11-07 00:37:50,575 INFO L226 Difference]: Without dead ends: 313 [2019-11-07 00:37:50,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-07 00:37:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2019-11-07 00:37:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-07 00:37:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2019-11-07 00:37:50,593 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2019-11-07 00:37:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,593 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2019-11-07 00:37:50,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2019-11-07 00:37:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 00:37:50,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,596 INFO L410 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] [2019-11-07 00:37:50,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-11-07 00:37:50,597 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296873215] [2019-11-07 00:37:50,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:50,647 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296873215] [2019-11-07 00:37:50,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,648 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:50,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352565780] [2019-11-07 00:37:50,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:50,648 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,649 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2019-11-07 00:37:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,679 INFO L93 Difference]: Finished difference Result 304 states and 406 transitions. [2019-11-07 00:37:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 00:37:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,681 INFO L225 Difference]: With dead ends: 304 [2019-11-07 00:37:50,681 INFO L226 Difference]: Without dead ends: 102 [2019-11-07 00:37:50,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-07 00:37:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-07 00:37:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-07 00:37:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-11-07 00:37:50,689 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-11-07 00:37:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,689 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-11-07 00:37:50,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-11-07 00:37:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:50,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,691 INFO L410 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] [2019-11-07 00:37:50,691 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-11-07 00:37:50,692 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,692 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983060130] [2019-11-07 00:37:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:50,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983060130] [2019-11-07 00:37:50,752 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,752 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:50,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112243136] [2019-11-07 00:37:50,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:50,753 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,755 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2019-11-07 00:37:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,804 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-11-07 00:37:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 00:37:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,806 INFO L225 Difference]: With dead ends: 130 [2019-11-07 00:37:50,806 INFO L226 Difference]: Without dead ends: 100 [2019-11-07 00:37:50,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-07 00:37:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-07 00:37:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-07 00:37:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-11-07 00:37:50,816 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-11-07 00:37:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,816 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-11-07 00:37:50,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-11-07 00:37:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 00:37:50,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,818 INFO L410 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] [2019-11-07 00:37:50,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-11-07 00:37:50,819 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,819 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086854336] [2019-11-07 00:37:50,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:50,897 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086854336] [2019-11-07 00:37:50,898 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,899 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:50,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835637050] [2019-11-07 00:37:50,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:50,900 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:50,901 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2019-11-07 00:37:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,949 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2019-11-07 00:37:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:50,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-07 00:37:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,952 INFO L225 Difference]: With dead ends: 152 [2019-11-07 00:37:50,952 INFO L226 Difference]: Without dead ends: 111 [2019-11-07 00:37:50,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-07 00:37:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-07 00:37:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-07 00:37:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-11-07 00:37:50,961 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-11-07 00:37:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,961 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-11-07 00:37:50,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-11-07 00:37:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 00:37:50,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,962 INFO L410 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] [2019-11-07 00:37:50,963 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-11-07 00:37:50,963 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,964 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547770944] [2019-11-07 00:37:50,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,046 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547770944] [2019-11-07 00:37:51,046 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,046 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:51,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153593126] [2019-11-07 00:37:51,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:51,047 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:51,049 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2019-11-07 00:37:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,111 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-11-07 00:37:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:51,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-07 00:37:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,113 INFO L225 Difference]: With dead ends: 116 [2019-11-07 00:37:51,113 INFO L226 Difference]: Without dead ends: 109 [2019-11-07 00:37:51,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-07 00:37:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-11-07 00:37:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-07 00:37:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-07 00:37:51,123 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-11-07 00:37:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,124 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-07 00:37:51,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-07 00:37:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:51,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,125 INFO L410 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] [2019-11-07 00:37:51,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,126 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-11-07 00:37:51,126 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,126 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482626289] [2019-11-07 00:37:51,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482626289] [2019-11-07 00:37:51,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,182 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:51,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136687333] [2019-11-07 00:37:51,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:51,183 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:51,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,184 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2019-11-07 00:37:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,218 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2019-11-07 00:37:51,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:51,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 00:37:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,220 INFO L225 Difference]: With dead ends: 122 [2019-11-07 00:37:51,220 INFO L226 Difference]: Without dead ends: 117 [2019-11-07 00:37:51,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-07 00:37:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-11-07 00:37:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-07 00:37:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-07 00:37:51,230 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-11-07 00:37:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,230 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-07 00:37:51,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-07 00:37:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:51,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,231 INFO L410 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] [2019-11-07 00:37:51,231 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-11-07 00:37:51,232 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,232 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341729354] [2019-11-07 00:37:51,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,354 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341729354] [2019-11-07 00:37:51,354 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:51,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48882892] [2019-11-07 00:37:51,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:51,356 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:51,357 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2019-11-07 00:37:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,387 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2019-11-07 00:37:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:51,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-07 00:37:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,389 INFO L225 Difference]: With dead ends: 146 [2019-11-07 00:37:51,390 INFO L226 Difference]: Without dead ends: 102 [2019-11-07 00:37:51,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-07 00:37:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-07 00:37:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-07 00:37:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-11-07 00:37:51,399 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-11-07 00:37:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,400 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-07 00:37:51,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-11-07 00:37:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 00:37:51,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,401 INFO L410 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] [2019-11-07 00:37:51,401 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-11-07 00:37:51,402 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,402 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549355995] [2019-11-07 00:37:51,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,511 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549355995] [2019-11-07 00:37:51,511 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,511 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:51,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878241492] [2019-11-07 00:37:51,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:51,512 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:51,513 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2019-11-07 00:37:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,627 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2019-11-07 00:37:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:51,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-07 00:37:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,628 INFO L225 Difference]: With dead ends: 132 [2019-11-07 00:37:51,629 INFO L226 Difference]: Without dead ends: 94 [2019-11-07 00:37:51,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-07 00:37:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-07 00:37:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-07 00:37:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-07 00:37:51,641 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-11-07 00:37:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,641 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-07 00:37:51,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-07 00:37:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 00:37:51,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,645 INFO L410 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] [2019-11-07 00:37:51,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-11-07 00:37:51,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532060689] [2019-11-07 00:37:51,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532060689] [2019-11-07 00:37:51,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:51,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834384562] [2019-11-07 00:37:51,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:51,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,707 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2019-11-07 00:37:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,729 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2019-11-07 00:37:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:51,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-07 00:37:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,730 INFO L225 Difference]: With dead ends: 130 [2019-11-07 00:37:51,731 INFO L226 Difference]: Without dead ends: 100 [2019-11-07 00:37:51,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-07 00:37:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-11-07 00:37:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-07 00:37:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-07 00:37:51,741 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-11-07 00:37:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,741 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-07 00:37:51,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-07 00:37:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 00:37:51,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,747 INFO L410 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] [2019-11-07 00:37:51,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-11-07 00:37:51,748 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,748 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965289707] [2019-11-07 00:37:51,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:51,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965289707] [2019-11-07 00:37:51,824 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:37:51,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443881860] [2019-11-07 00:37:51,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:37:51,825 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:37:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:51,826 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2019-11-07 00:37:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,882 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-11-07 00:37:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:51,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-07 00:37:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,886 INFO L225 Difference]: With dead ends: 116 [2019-11-07 00:37:51,886 INFO L226 Difference]: Without dead ends: 97 [2019-11-07 00:37:51,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-07 00:37:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-07 00:37:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-07 00:37:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-11-07 00:37:51,894 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-11-07 00:37:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,896 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-11-07 00:37:51,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:37:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-11-07 00:37:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:51,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,899 INFO L410 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] [2019-11-07 00:37:51,899 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-11-07 00:37:51,900 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,900 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015657162] [2019-11-07 00:37:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:52,073 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015657162] [2019-11-07 00:37:52,073 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:37:52,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731261286] [2019-11-07 00:37:52,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:37:52,074 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:37:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:52,075 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 11 states. [2019-11-07 00:37:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,385 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-07 00:37:52,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:52,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-07 00:37:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,387 INFO L225 Difference]: With dead ends: 109 [2019-11-07 00:37:52,387 INFO L226 Difference]: Without dead ends: 91 [2019-11-07 00:37:52,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:37:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-07 00:37:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-11-07 00:37:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-07 00:37:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-11-07 00:37:52,394 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-11-07 00:37:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,395 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-11-07 00:37:52,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:37:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-11-07 00:37:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:52,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,396 INFO L410 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] [2019-11-07 00:37:52,396 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-11-07 00:37:52,397 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,397 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416750414] [2019-11-07 00:37:52,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:52,502 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416750414] [2019-11-07 00:37:52,502 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,502 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:52,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136653585] [2019-11-07 00:37:52,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:52,503 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:52,504 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2019-11-07 00:37:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,597 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-07 00:37:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:52,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-07 00:37:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,599 INFO L225 Difference]: With dead ends: 98 [2019-11-07 00:37:52,599 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 00:37:52,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 00:37:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-07 00:37:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 00:37:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-07 00:37:52,608 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-11-07 00:37:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-07 00:37:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-07 00:37:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 00:37:52,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,609 INFO L410 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] [2019-11-07 00:37:52,609 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-11-07 00:37:52,610 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,610 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575957619] [2019-11-07 00:37:52,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:52,721 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575957619] [2019-11-07 00:37:52,722 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,722 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:52,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509072759] [2019-11-07 00:37:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:52,723 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:52,724 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-11-07 00:37:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,764 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-11-07 00:37:52,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:52,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-07 00:37:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,767 INFO L225 Difference]: With dead ends: 87 [2019-11-07 00:37:52,767 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 00:37:52,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 00:37:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-07 00:37:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 00:37:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-11-07 00:37:52,777 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-11-07 00:37:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,778 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-11-07 00:37:52,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-11-07 00:37:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 00:37:52,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:52,781 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,782 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-11-07 00:37:52,782 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,782 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631657899] [2019-11-07 00:37:52,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:37:52,841 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631657899] [2019-11-07 00:37:52,841 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,841 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:52,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629572014] [2019-11-07 00:37:52,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:52,842 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:52,843 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2019-11-07 00:37:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,925 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-07 00:37:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:52,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-07 00:37:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,927 INFO L225 Difference]: With dead ends: 78 [2019-11-07 00:37:52,927 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:37:52,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:37:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:37:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:37:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:37:52,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-11-07 00:37:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,930 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:37:52,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:37:52,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:37:52,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:37:53,806 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-07 00:37:55,382 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-11-07 00:37:55,990 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-11-07 00:37:56,445 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-07 00:37:56,693 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: true [2019-11-07 00:37:56,694 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 567 574) no Hoare annotation was computed. [2019-11-07 00:37:56,694 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2019-11-07 00:37:56,694 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: true [2019-11-07 00:37:56,694 INFO L446 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: true [2019-11-07 00:37:56,694 INFO L443 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2019-11-07 00:37:56,694 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 617 627) no Hoare annotation was computed. [2019-11-07 00:37:56,694 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2019-11-07 00:37:56,695 INFO L443 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2019-11-07 00:37:56,695 INFO L439 ceAbstractionStarter]: At program point L733(line 733) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-11-07 00:37:56,695 INFO L439 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,695 INFO L443 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2019-11-07 00:37:56,695 INFO L439 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,695 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2019-11-07 00:37:56,696 INFO L439 ceAbstractionStarter]: At program point KbFilter_PowerENTRY(lines 688 743) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,696 INFO L443 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2019-11-07 00:37:56,696 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2019-11-07 00:37:56,696 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerFINAL(lines 688 743) no Hoare annotation was computed. [2019-11-07 00:37:56,696 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2019-11-07 00:37:56,696 INFO L439 ceAbstractionStarter]: At program point L739(line 739) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,696 INFO L443 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2019-11-07 00:37:56,697 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2019-11-07 00:37:56,697 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0))) [2019-11-07 00:37:56,697 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 42 55) no Hoare annotation was computed. [2019-11-07 00:37:56,697 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 56 77) no Hoare annotation was computed. [2019-11-07 00:37:56,697 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,697 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2019-11-07 00:37:56,698 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2019-11-07 00:37:56,698 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 1008 1015) no Hoare annotation was computed. [2019-11-07 00:37:56,698 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2019-11-07 00:37:56,698 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-11-07 00:37:56,698 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2019-11-07 00:37:56,698 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2019-11-07 00:37:56,699 INFO L439 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,699 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-11-07 00:37:56,699 INFO L443 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2019-11-07 00:37:56,699 INFO L439 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,699 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-11-07 00:37:56,699 INFO L439 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,699 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L443 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L443 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L439 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,700 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2019-11-07 00:37:56,700 INFO L439 ceAbstractionStarter]: At program point L327(line 327) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,701 INFO L443 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2019-11-07 00:37:56,701 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-11-07 00:37:56,701 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,701 INFO L443 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2019-11-07 00:37:56,701 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,701 INFO L439 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,702 INFO L439 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,702 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-11-07 00:37:56,702 INFO L439 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,702 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2019-11-07 00:37:56,702 INFO L439 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,702 INFO L443 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2019-11-07 00:37:56,702 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2019-11-07 00:37:56,703 INFO L439 ceAbstractionStarter]: At program point L338-2(lines 338 341) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-07 00:37:56,703 INFO L443 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2019-11-07 00:37:56,703 INFO L439 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-07 00:37:56,703 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2019-11-07 00:37:56,703 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-11-07 00:37:56,703 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-11-07 00:37:56,703 INFO L443 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2019-11-07 00:37:56,704 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-11-07 00:37:56,704 INFO L439 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-07 00:37:56,704 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-11-07 00:37:56,704 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-11-07 00:37:56,704 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-11-07 00:37:56,704 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-11-07 00:37:56,705 INFO L439 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (let ((.cse1 (= ~s~0 ~MPR1~0)) (.cse2 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and .cse1 .cse2 (= 259 IofCallDriver_~returnVal2~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse2 (= 0 IofCallDriver_~returnVal2~0) .cse1) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and .cse1 .cse2 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))))) [2019-11-07 00:37:56,705 INFO L439 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (<= ~s~0 1) (<= 1 ~s~0)) (not (<= 1 |old(~s~0)|))))) [2019-11-07 00:37:56,705 INFO L443 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2019-11-07 00:37:56,705 INFO L439 ceAbstractionStarter]: At program point L511(lines 510 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-11-07 00:37:56,705 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-11-07 00:37:56,705 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2019-11-07 00:37:56,706 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-11-07 00:37:56,706 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 480 552) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (<= ~s~0 1) (<= 1 ~s~0)) (not (<= 1 |old(~s~0)|))))) [2019-11-07 00:37:56,706 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 480 552) no Hoare annotation was computed. [2019-11-07 00:37:56,706 INFO L439 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-11-07 00:37:56,706 INFO L443 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2019-11-07 00:37:56,706 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2019-11-07 00:37:56,707 INFO L439 ceAbstractionStarter]: At program point L504(lines 503 526) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 ~MPR1~0)) (not (<= 1 |old(~s~0)|))))) [2019-11-07 00:37:56,707 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2019-11-07 00:37:56,707 INFO L439 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (<= 1 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-11-07 00:37:56,707 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-11-07 00:37:56,707 INFO L443 ceAbstractionStarter]: For program point L488-1(lines 488 500) no Hoare annotation was computed. [2019-11-07 00:37:56,707 INFO L439 ceAbstractionStarter]: At program point L509(lines 508 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-11-07 00:37:56,708 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~setEventCalled~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 ~setEventCalled~0)) (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 744 820) no Hoare annotation was computed. [2019-11-07 00:37:56,708 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-11-07 00:37:56,709 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-11-07 00:37:56,709 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 744 820) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,709 INFO L439 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,709 INFO L439 ceAbstractionStarter]: At program point L755(line 755) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-07 00:37:56,709 INFO L443 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2019-11-07 00:37:56,709 INFO L439 ceAbstractionStarter]: At program point L813(line 813) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-07 00:37:56,709 INFO L443 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2019-11-07 00:37:56,710 INFO L439 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,710 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2019-11-07 00:37:56,710 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2019-11-07 00:37:56,710 INFO L439 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,710 INFO L439 ceAbstractionStarter]: At program point L761(line 761) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-07 00:37:56,710 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-11-07 00:37:56,710 INFO L443 ceAbstractionStarter]: For program point L753-1(lines 753 765) no Hoare annotation was computed. [2019-11-07 00:37:56,710 INFO L439 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,710 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L439 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,711 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L443 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L439 ceAbstractionStarter]: At program point KbFilter_CreateCloseENTRY(lines 628 663) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,711 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseFINAL(lines 628 663) no Hoare annotation was computed. [2019-11-07 00:37:56,711 INFO L439 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,712 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2019-11-07 00:37:56,712 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L439 ceAbstractionStarter]: At program point L1002(line 1002) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L439 ceAbstractionStarter]: At program point L891(lines 890 985) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L439 ceAbstractionStarter]: At program point L883(lines 882 987) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2019-11-07 00:37:56,713 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-11-07 00:37:56,714 INFO L439 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,714 INFO L439 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,714 INFO L439 ceAbstractionStarter]: At program point L996(line 996) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,714 INFO L443 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2019-11-07 00:37:56,714 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-11-07 00:37:56,714 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2019-11-07 00:37:56,714 INFO L443 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2019-11-07 00:37:56,714 INFO L439 ceAbstractionStarter]: At program point KbFilter_InternIoCtlENTRY(lines 821 1006) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,715 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2019-11-07 00:37:56,715 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-11-07 00:37:56,715 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2019-11-07 00:37:56,715 INFO L439 ceAbstractionStarter]: At program point L605(lines 604 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1)))))) [2019-11-07 00:37:56,715 INFO L439 ceAbstractionStarter]: At program point L603(lines 602 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1)))))) [2019-11-07 00:37:56,715 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L439 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-11-07 00:37:56,716 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L443 ceAbstractionStarter]: For program point L593-1(lines 580 599) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 575 616) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2019-11-07 00:37:56,716 INFO L439 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 (= ~s~0 ~NP~0)) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-11-07 00:37:56,716 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or (= ~s~0 ~NP~0) .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (and (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-11-07 00:37:56,717 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-11-07 00:37:56,717 INFO L439 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0))))) [2019-11-07 00:37:56,717 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2019-11-07 00:37:56,717 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-11-07 00:37:56,717 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 553 566) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2))) [2019-11-07 00:37:56,717 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2019-11-07 00:37:56,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:37:56,717 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,718 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:37:56,718 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:37:56,718 INFO L439 ceAbstractionStarter]: At program point KbFilter_DispatchPassThroughENTRY(lines 664 687) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-11-07 00:37:56,718 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-11-07 00:37:56,718 INFO L439 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-11-07 00:37:56,718 INFO L443 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2019-11-07 00:37:56,718 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughFINAL(lines 664 687) no Hoare annotation was computed. [2019-11-07 00:37:56,719 INFO L439 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-11-07 00:37:56,719 INFO L443 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2019-11-07 00:37:56,719 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2019-11-07 00:37:56,719 INFO L439 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,719 INFO L439 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,719 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2019-11-07 00:37:56,719 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-11-07 00:37:56,719 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L439 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,720 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (<= 1 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= ~s~0 1) (<= 1 ~s~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,720 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2019-11-07 00:37:56,720 INFO L439 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-11-07 00:37:56,721 INFO L446 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2019-11-07 00:37:56,721 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2019-11-07 00:37:56,721 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2019-11-07 00:37:56,721 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,721 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2019-11-07 00:37:56,721 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-11-07 00:37:56,721 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2019-11-07 00:37:56,721 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0))) [2019-11-07 00:37:56,722 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 80 293) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L439 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-11-07 00:37:56,722 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-11-07 00:37:56,722 INFO L439 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2019-11-07 00:37:56,723 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,724 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-11-07 00:37:56,724 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= 1 ~s~0) (<= ~s~0 1))) [2019-11-07 00:37:56,724 INFO L439 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,725 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2019-11-07 00:37:56,725 INFO L439 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,725 INFO L443 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2019-11-07 00:37:56,725 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2019-11-07 00:37:56,725 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2019-11-07 00:37:56,725 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-07 00:37:56,725 INFO L439 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~s~0 ~NP~0) .cse0) (not (= |old(~compRegistered~0)| 0)) (and (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))) [2019-11-07 00:37:56,726 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2019-11-07 00:37:56,726 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2019-11-07 00:37:56,726 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2019-11-07 00:37:56,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:37:56 BoogieIcfgContainer [2019-11-07 00:37:56,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:37:56,763 INFO L168 Benchmark]: Toolchain (without parser) took 9861.21 ms. Allocated memory was 136.8 MB in the beginning and 334.5 MB in the end (delta: 197.7 MB). Free memory was 100.6 MB in the beginning and 107.3 MB in the end (delta: -6.7 MB). Peak memory consumption was 215.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,763 INFO L168 Benchmark]: CDTParser took 1.10 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.03 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 174.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,765 INFO L168 Benchmark]: Boogie Preprocessor took 69.09 ms. Allocated memory is still 201.3 MB. Free memory was 174.1 MB in the beginning and 170.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,765 INFO L168 Benchmark]: RCFGBuilder took 999.64 ms. Allocated memory is still 201.3 MB. Free memory was 170.6 MB in the beginning and 100.1 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,766 INFO L168 Benchmark]: TraceAbstraction took 8127.88 ms. Allocated memory was 201.3 MB in the beginning and 334.5 MB in the end (delta: 133.2 MB). Free memory was 100.1 MB in the beginning and 107.3 MB in the end (delta: -7.3 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:56,770 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 660.03 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 174.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.09 ms. Allocated memory is still 201.3 MB. Free memory was 174.1 MB in the beginning and 170.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 999.64 ms. Allocated memory is still 201.3 MB. Free memory was 170.6 MB in the beginning and 100.1 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8127.88 ms. Allocated memory was 201.3 MB in the beginning and 334.5 MB in the end (delta: 133.2 MB). Free memory was 100.1 MB in the beginning and 107.3 MB in the end (delta: -7.3 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: 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: 362]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || (((((((!(1 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && 0 <= status) && s <= 1) && 1 <= s) && NP + 4 <= MPR1) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (((0 == compRegistered && status == 0) && 1 <= s) && s <= 1) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || s == NP) && ((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || (s == MPR1 && __cil_tmp7 + 1073741802 == 0)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || 0 <= status) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(NP <= 1)) || (__cil_tmp7 + 1073741802 == 0 && s == MPR1)) || !(1 <= \old(s))) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((((((((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 259 == returnVal2) && 1 <= setEventCalled) && setEventCalled <= 1) || !(NP + 5 <= MPR3)) || ((__cil_tmp7 + 1073741802 == 0 && 0 == returnVal2) && s == MPR1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || ((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && returnVal2 + 1073741823 <= 0)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) && (((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) && (((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. Result: SAFE, OverallTime: 7.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, HoareTripleCheckerStatistics: 2942 SDtfs, 1643 SDslu, 3427 SDs, 0 SdLazy, 700 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 330 PreInvPairs, 403 NumberOfFragments, 2652 HoareAnnotationTreeSize, 330 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 84 FomulaSimplificationsInter, 2094 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 90456 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, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...