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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:48:45,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:48:45,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:48:45,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:48:45,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:48:45,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:48:45,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:48:45,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:48:45,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:48:45,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:48:45,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:48:45,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:48:45,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:48:45,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:48:45,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:48:45,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:48:45,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:48:45,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:48:45,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:48:45,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:48:45,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:48:45,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:48:45,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:48:45,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:48:45,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:48:45,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:48:45,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:48:45,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:48:45,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:48:45,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:48:45,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:48:45,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:48:45,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:48:45,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:48:45,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:48:45,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:48:45,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:48:45,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:48:45,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:48:45,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:48:45,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:48:45,412 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-10-07 13:48:45,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:48:45,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:48:45,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:48:45,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:48:45,435 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:48:45,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:48:45,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:48:45,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:48:45,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:48:45,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:48:45,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:48:45,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:48:45,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:48:45,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:48:45,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:48:45,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:48:45,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:48:45,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:48:45,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:48:45,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:48:45,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:48:45,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:48:45,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:48:45,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:48:45,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:48:45,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:48:45,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:48:45,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:48:45,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:48:45,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:48:45,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:48:45,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:48:45,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:48:45,734 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:48:45,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-07 13:48:45,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acdaf88c/dde98a67a125414491630a5055e09d41/FLAG578124b84 [2019-10-07 13:48:46,467 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:48:46,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-07 13:48:46,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acdaf88c/dde98a67a125414491630a5055e09d41/FLAG578124b84 [2019-10-07 13:48:46,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acdaf88c/dde98a67a125414491630a5055e09d41 [2019-10-07 13:48:46,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:48:46,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:48:46,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:48:46,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:48:46,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:48:46,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:48:46" (1/1) ... [2019-10-07 13:48:46,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14543c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:46, skipping insertion in model container [2019-10-07 13:48:46,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:48:46" (1/1) ... [2019-10-07 13:48:46,676 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:48:46,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:48:47,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:48:47,278 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:48:47,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:48:47,475 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:48:47,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47 WrapperNode [2019-10-07 13:48:47,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:48:47,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:48:47,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:48:47,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:48:47,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (1/1) ... [2019-10-07 13:48:47,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:48:47,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:48:47,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:48:47,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:48:47,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48: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-10-07 13:48:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:48:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:48:47,682 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:48:47,682 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:48:47,682 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-07 13:48:47,683 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-07 13:48:47,683 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-07 13:48:47,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-07 13:48:47,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-07 13:48:47,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-07 13:48:47,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-07 13:48:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-07 13:48:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-07 13:48:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-07 13:48:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-07 13:48:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-07 13:48:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-07 13:48:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:48:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:48:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-07 13:48:47,690 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-07 13:48:47,690 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:48:47,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:48:47,690 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:48:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:48:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:48:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:48:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:48:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:48:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-07 13:48:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-07 13:48:47,694 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:48:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:48:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:48:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:48:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:48:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-07 13:48:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-07 13:48:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:48:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:48:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:48:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:48:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:48:48,318 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,446 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-07 13:48:48,447 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-07 13:48:48,458 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,505 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:48:48,505 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:48:48,529 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,548 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:48:48,549 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:48:48,646 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,705 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-07 13:48:48,705 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-07 13:48:48,706 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-07 13:48:48,713 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,884 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-07 13:48:48,885 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-07 13:48:48,886 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,917 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:48:48,917 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:48:48,945 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:48,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 13:48:48,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 13:48:48,967 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:49,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:48:49,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:48:49,195 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:49,200 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:48:49,200 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:48:49,779 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:48:49,779 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:48:49,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:48:49 BoogieIcfgContainer [2019-10-07 13:48:49,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:48:49,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:48:49,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:48:49,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:48:49,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:48:46" (1/3) ... [2019-10-07 13:48:49,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e33040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:48:49, skipping insertion in model container [2019-10-07 13:48:49,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:47" (2/3) ... [2019-10-07 13:48:49,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e33040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:48:49, skipping insertion in model container [2019-10-07 13:48:49,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:48:49" (3/3) ... [2019-10-07 13:48:49,790 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-10-07 13:48:49,799 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:48:49,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:48:49,819 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:48:49,850 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:48:49,850 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:48:49,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:48:49,850 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:48:49,850 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:48:49,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:48:49,851 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:48:49,851 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:48:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states. [2019-10-07 13:48:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:48:49,886 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:49,887 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:49,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1471663135, now seen corresponding path program 1 times [2019-10-07 13:48:49,904 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:49,904 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,905 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,905 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:50,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:50,131 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:50,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:50,152 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 3 states. [2019-10-07 13:48:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:50,335 INFO L93 Difference]: Finished difference Result 702 states and 1087 transitions. [2019-10-07 13:48:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:50,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:48:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:50,356 INFO L225 Difference]: With dead ends: 702 [2019-10-07 13:48:50,356 INFO L226 Difference]: Without dead ends: 402 [2019-10-07 13:48:50,364 INFO L606 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-10-07 13:48:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-07 13:48:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-10-07 13:48:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-07 13:48:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 579 transitions. [2019-10-07 13:48:50,468 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 579 transitions. Word has length 18 [2019-10-07 13:48:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:50,469 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 579 transitions. [2019-10-07 13:48:50,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 579 transitions. [2019-10-07 13:48:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:48:50,472 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:50,472 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:50,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1826833932, now seen corresponding path program 1 times [2019-10-07 13:48:50,474 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:50,474 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:50,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:50,720 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,720 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:50,720 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:50,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:50,726 INFO L87 Difference]: Start difference. First operand 402 states and 579 transitions. Second operand 3 states. [2019-10-07 13:48:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:50,988 INFO L93 Difference]: Finished difference Result 572 states and 806 transitions. [2019-10-07 13:48:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:50,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 13:48:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:50,996 INFO L225 Difference]: With dead ends: 572 [2019-10-07 13:48:50,997 INFO L226 Difference]: Without dead ends: 475 [2019-10-07 13:48:50,998 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-07 13:48:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-07 13:48:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-10-07 13:48:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-07 13:48:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 672 transitions. [2019-10-07 13:48:51,082 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 672 transitions. Word has length 21 [2019-10-07 13:48:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,082 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 672 transitions. [2019-10-07 13:48:51,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 672 transitions. [2019-10-07 13:48:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:48:51,084 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,085 INFO L385 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] [2019-10-07 13:48:51,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1575704033, now seen corresponding path program 1 times [2019-10-07 13:48:51,086 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,086 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,086 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,086 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,182 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,182 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,183 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:51,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,184 INFO L87 Difference]: Start difference. First operand 471 states and 672 transitions. Second operand 3 states. [2019-10-07 13:48:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,241 INFO L93 Difference]: Finished difference Result 685 states and 950 transitions. [2019-10-07 13:48:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-07 13:48:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,248 INFO L225 Difference]: With dead ends: 685 [2019-10-07 13:48:51,248 INFO L226 Difference]: Without dead ends: 578 [2019-10-07 13:48:51,249 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-07 13:48:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-07 13:48:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 541. [2019-10-07 13:48:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-07 13:48:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 764 transitions. [2019-10-07 13:48:51,311 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 764 transitions. Word has length 26 [2019-10-07 13:48:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,312 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 764 transitions. [2019-10-07 13:48:51,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 764 transitions. [2019-10-07 13:48:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:48:51,322 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,322 INFO L385 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] [2019-10-07 13:48:51,323 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash 673908008, now seen corresponding path program 1 times [2019-10-07 13:48:51,323 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,381 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,381 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,382 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:51,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,383 INFO L87 Difference]: Start difference. First operand 541 states and 764 transitions. Second operand 3 states. [2019-10-07 13:48:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,562 INFO L93 Difference]: Finished difference Result 1024 states and 1490 transitions. [2019-10-07 13:48:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:48:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,569 INFO L225 Difference]: With dead ends: 1024 [2019-10-07 13:48:51,569 INFO L226 Difference]: Without dead ends: 818 [2019-10-07 13:48:51,570 INFO L606 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-10-07 13:48:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-07 13:48:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 668. [2019-10-07 13:48:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-10-07 13:48:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2019-10-07 13:48:51,618 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 27 [2019-10-07 13:48:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,618 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2019-10-07 13:48:51,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2019-10-07 13:48:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:48:51,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,620 INFO L385 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-10-07 13:48:51,621 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -822079973, now seen corresponding path program 1 times [2019-10-07 13:48:51,621 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,622 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,622 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,622 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,707 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,708 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,708 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:48:51,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:48:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:48:51,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:48:51,709 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand 5 states. [2019-10-07 13:48:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,459 INFO L93 Difference]: Finished difference Result 1132 states and 1671 transitions. [2019-10-07 13:48:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:48:52,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-07 13:48:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,466 INFO L225 Difference]: With dead ends: 1132 [2019-10-07 13:48:52,467 INFO L226 Difference]: Without dead ends: 717 [2019-10-07 13:48:52,469 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:48:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-07 13:48:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 656. [2019-10-07 13:48:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-07 13:48:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 966 transitions. [2019-10-07 13:48:52,511 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 966 transitions. Word has length 28 [2019-10-07 13:48:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,511 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 966 transitions. [2019-10-07 13:48:52,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:48:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 966 transitions. [2019-10-07 13:48:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 13:48:52,513 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,514 INFO L385 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] [2019-10-07 13:48:52,514 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash -808448961, now seen corresponding path program 1 times [2019-10-07 13:48:52,515 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,515 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,567 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,568 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,568 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:52,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:52,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:52,569 INFO L87 Difference]: Start difference. First operand 656 states and 966 transitions. Second operand 3 states. [2019-10-07 13:48:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,660 INFO L93 Difference]: Finished difference Result 659 states and 968 transitions. [2019-10-07 13:48:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:52,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-07 13:48:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,664 INFO L225 Difference]: With dead ends: 659 [2019-10-07 13:48:52,664 INFO L226 Difference]: Without dead ends: 655 [2019-10-07 13:48:52,665 INFO L606 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-10-07 13:48:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-07 13:48:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-07 13:48:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-07 13:48:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 963 transitions. [2019-10-07 13:48:52,711 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 963 transitions. Word has length 29 [2019-10-07 13:48:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,713 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 963 transitions. [2019-10-07 13:48:52,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 963 transitions. [2019-10-07 13:48:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 13:48:52,717 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,717 INFO L385 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] [2019-10-07 13:48:52,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1336520426, now seen corresponding path program 1 times [2019-10-07 13:48:52,718 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,790 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,790 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,790 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:52,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:52,792 INFO L87 Difference]: Start difference. First operand 655 states and 963 transitions. Second operand 3 states. [2019-10-07 13:48:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,869 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2019-10-07 13:48:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:52,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-07 13:48:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,874 INFO L225 Difference]: With dead ends: 925 [2019-10-07 13:48:52,874 INFO L226 Difference]: Without dead ends: 737 [2019-10-07 13:48:52,876 INFO L606 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-10-07 13:48:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-07 13:48:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 637. [2019-10-07 13:48:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-07 13:48:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 902 transitions. [2019-10-07 13:48:52,912 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 902 transitions. Word has length 35 [2019-10-07 13:48:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,913 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 902 transitions. [2019-10-07 13:48:52,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 902 transitions. [2019-10-07 13:48:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:48:52,915 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,915 INFO L385 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] [2019-10-07 13:48:52,915 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash -804463058, now seen corresponding path program 1 times [2019-10-07 13:48:52,916 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,916 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,917 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,963 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,964 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,964 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:52,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:52,968 INFO L87 Difference]: Start difference. First operand 637 states and 902 transitions. Second operand 3 states. [2019-10-07 13:48:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:53,025 INFO L93 Difference]: Finished difference Result 703 states and 983 transitions. [2019-10-07 13:48:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:53,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-07 13:48:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:53,033 INFO L225 Difference]: With dead ends: 703 [2019-10-07 13:48:53,033 INFO L226 Difference]: Without dead ends: 685 [2019-10-07 13:48:53,034 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-07 13:48:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-07 13:48:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 670. [2019-10-07 13:48:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-07 13:48:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2019-10-07 13:48:53,076 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 36 [2019-10-07 13:48:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:53,076 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2019-10-07 13:48:53,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2019-10-07 13:48:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:53,082 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:53,082 INFO L385 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] [2019-10-07 13:48:53,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1782796671, now seen corresponding path program 1 times [2019-10-07 13:48:53,083 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:53,083 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,083 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,083 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:53,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,177 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:53,177 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:48:53,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:48:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:48:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:48:53,179 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand 4 states. [2019-10-07 13:48:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:53,538 INFO L93 Difference]: Finished difference Result 771 states and 1056 transitions. [2019-10-07 13:48:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:48:53,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-07 13:48:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:53,544 INFO L225 Difference]: With dead ends: 771 [2019-10-07 13:48:53,545 INFO L226 Difference]: Without dead ends: 597 [2019-10-07 13:48:53,546 INFO L606 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-10-07 13:48:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-07 13:48:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 568. [2019-10-07 13:48:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-07 13:48:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 785 transitions. [2019-10-07 13:48:53,592 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 785 transitions. Word has length 42 [2019-10-07 13:48:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:53,594 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 785 transitions. [2019-10-07 13:48:53,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:48:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 785 transitions. [2019-10-07 13:48:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:53,598 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:53,599 INFO L385 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] [2019-10-07 13:48:53,599 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 432749520, now seen corresponding path program 1 times [2019-10-07 13:48:53,600 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:53,600 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,601 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,601 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:53,684 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,716 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:53,716 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:53,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:53,717 INFO L87 Difference]: Start difference. First operand 568 states and 785 transitions. Second operand 3 states. [2019-10-07 13:48:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:53,769 INFO L93 Difference]: Finished difference Result 773 states and 1059 transitions. [2019-10-07 13:48:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:53,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:48:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:53,777 INFO L225 Difference]: With dead ends: 773 [2019-10-07 13:48:53,778 INFO L226 Difference]: Without dead ends: 599 [2019-10-07 13:48:53,779 INFO L606 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-10-07 13:48:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-07 13:48:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 568. [2019-10-07 13:48:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-07 13:48:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 783 transitions. [2019-10-07 13:48:53,821 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 783 transitions. Word has length 42 [2019-10-07 13:48:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:53,822 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 783 transitions. [2019-10-07 13:48:53,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 783 transitions. [2019-10-07 13:48:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:48:53,824 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:53,824 INFO L385 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] [2019-10-07 13:48:53,824 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1161412528, now seen corresponding path program 1 times [2019-10-07 13:48:53,825 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:53,825 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:53,887 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:53,887 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:53,887 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:53,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:53,888 INFO L87 Difference]: Start difference. First operand 568 states and 783 transitions. Second operand 3 states. [2019-10-07 13:48:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:53,988 INFO L93 Difference]: Finished difference Result 726 states and 994 transitions. [2019-10-07 13:48:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:53,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 13:48:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:53,998 INFO L225 Difference]: With dead ends: 726 [2019-10-07 13:48:53,998 INFO L226 Difference]: Without dead ends: 716 [2019-10-07 13:48:54,001 INFO L606 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-10-07 13:48:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-07 13:48:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 635. [2019-10-07 13:48:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-07 13:48:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 864 transitions. [2019-10-07 13:48:54,037 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 864 transitions. Word has length 40 [2019-10-07 13:48:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:54,038 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 864 transitions. [2019-10-07 13:48:54,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 864 transitions. [2019-10-07 13:48:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:48:54,040 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:54,040 INFO L385 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] [2019-10-07 13:48:54,041 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1003994184, now seen corresponding path program 1 times [2019-10-07 13:48:54,041 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:54,041 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,041 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:54,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,078 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:54,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:54,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:54,080 INFO L87 Difference]: Start difference. First operand 635 states and 864 transitions. Second operand 3 states. [2019-10-07 13:48:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:54,116 INFO L93 Difference]: Finished difference Result 744 states and 989 transitions. [2019-10-07 13:48:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:54,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 13:48:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:54,121 INFO L225 Difference]: With dead ends: 744 [2019-10-07 13:48:54,121 INFO L226 Difference]: Without dead ends: 658 [2019-10-07 13:48:54,122 INFO L606 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-10-07 13:48:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-07 13:48:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2019-10-07 13:48:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-07 13:48:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2019-10-07 13:48:54,158 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 43 [2019-10-07 13:48:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:54,158 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2019-10-07 13:48:54,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2019-10-07 13:48:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:48:54,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:54,161 INFO L385 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] [2019-10-07 13:48:54,161 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1200179264, now seen corresponding path program 1 times [2019-10-07 13:48:54,161 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:54,161 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:54,278 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,279 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:54,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:48:54,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:48:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:48:54,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:48:54,280 INFO L87 Difference]: Start difference. First operand 632 states and 856 transitions. Second operand 10 states. [2019-10-07 13:48:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:56,688 INFO L93 Difference]: Finished difference Result 808 states and 1130 transitions. [2019-10-07 13:48:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:48:56,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-07 13:48:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:56,698 INFO L225 Difference]: With dead ends: 808 [2019-10-07 13:48:56,698 INFO L226 Difference]: Without dead ends: 800 [2019-10-07 13:48:56,699 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:48:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-07 13:48:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 639. [2019-10-07 13:48:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-07 13:48:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 858 transitions. [2019-10-07 13:48:56,748 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 858 transitions. Word has length 41 [2019-10-07 13:48:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:56,749 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 858 transitions. [2019-10-07 13:48:56,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:48:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 858 transitions. [2019-10-07 13:48:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:48:56,751 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:56,751 INFO L385 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] [2019-10-07 13:48:56,751 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1361312649, now seen corresponding path program 1 times [2019-10-07 13:48:56,752 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:56,752 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:56,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:56,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:56,828 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:56,829 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:56,829 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:48:56,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:48:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:48:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:48:56,830 INFO L87 Difference]: Start difference. First operand 639 states and 858 transitions. Second operand 7 states. [2019-10-07 13:48:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:57,955 INFO L93 Difference]: Finished difference Result 768 states and 1067 transitions. [2019-10-07 13:48:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:48:57,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-07 13:48:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:57,959 INFO L225 Difference]: With dead ends: 768 [2019-10-07 13:48:57,960 INFO L226 Difference]: Without dead ends: 713 [2019-10-07 13:48:57,961 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:48:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-07 13:48:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 639. [2019-10-07 13:48:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-07 13:48:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 856 transitions. [2019-10-07 13:48:58,002 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 856 transitions. Word has length 41 [2019-10-07 13:48:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:58,002 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 856 transitions. [2019-10-07 13:48:58,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:48:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 856 transitions. [2019-10-07 13:48:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:58,004 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:58,005 INFO L385 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] [2019-10-07 13:48:58,005 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 808827987, now seen corresponding path program 1 times [2019-10-07 13:48:58,005 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:58,006 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:58,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:58,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:58,098 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:58,099 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:58,099 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:48:58,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:48:58,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:48:58,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:48:58,100 INFO L87 Difference]: Start difference. First operand 639 states and 856 transitions. Second operand 9 states. [2019-10-07 13:48:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:59,769 INFO L93 Difference]: Finished difference Result 762 states and 1049 transitions. [2019-10-07 13:48:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:48:59,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-07 13:48:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:59,773 INFO L225 Difference]: With dead ends: 762 [2019-10-07 13:48:59,774 INFO L226 Difference]: Without dead ends: 709 [2019-10-07 13:48:59,774 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:48:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-07 13:48:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 574. [2019-10-07 13:48:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-07 13:48:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 772 transitions. [2019-10-07 13:48:59,816 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 772 transitions. Word has length 42 [2019-10-07 13:48:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:59,817 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 772 transitions. [2019-10-07 13:48:59,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:48:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 772 transitions. [2019-10-07 13:48:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:59,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:59,819 INFO L385 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] [2019-10-07 13:48:59,820 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -971270421, now seen corresponding path program 1 times [2019-10-07 13:48:59,820 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:59,820 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,821 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:59,867 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,868 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:59,868 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:59,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:59,871 INFO L87 Difference]: Start difference. First operand 574 states and 772 transitions. Second operand 3 states. [2019-10-07 13:48:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:59,974 INFO L93 Difference]: Finished difference Result 715 states and 955 transitions. [2019-10-07 13:48:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:59,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:48:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:59,978 INFO L225 Difference]: With dead ends: 715 [2019-10-07 13:48:59,978 INFO L226 Difference]: Without dead ends: 704 [2019-10-07 13:48:59,979 INFO L606 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-10-07 13:48:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-07 13:49:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 621. [2019-10-07 13:49:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-07 13:49:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 823 transitions. [2019-10-07 13:49:00,022 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 823 transitions. Word has length 42 [2019-10-07 13:49:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:00,023 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 823 transitions. [2019-10-07 13:49:00,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 823 transitions. [2019-10-07 13:49:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:49:00,025 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:00,025 INFO L385 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] [2019-10-07 13:49:00,025 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 399258757, now seen corresponding path program 1 times [2019-10-07 13:49:00,026 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:00,026 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:00,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:00,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:00,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:00,148 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:00,148 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:00,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:00,150 INFO L87 Difference]: Start difference. First operand 621 states and 823 transitions. Second operand 8 states. [2019-10-07 13:49:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:00,323 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2019-10-07 13:49:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:00,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-07 13:49:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:00,327 INFO L225 Difference]: With dead ends: 636 [2019-10-07 13:49:00,327 INFO L226 Difference]: Without dead ends: 632 [2019-10-07 13:49:00,333 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-07 13:49:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2019-10-07 13:49:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-07 13:49:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 834 transitions. [2019-10-07 13:49:00,373 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 834 transitions. Word has length 43 [2019-10-07 13:49:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:00,374 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 834 transitions. [2019-10-07 13:49:00,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 834 transitions. [2019-10-07 13:49:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:49:00,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:00,376 INFO L385 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] [2019-10-07 13:49:00,376 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 398981927, now seen corresponding path program 1 times [2019-10-07 13:49:00,377 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:00,377 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:00,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:00,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:00,426 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:00,427 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:00,427 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:00,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:00,428 INFO L87 Difference]: Start difference. First operand 630 states and 834 transitions. Second operand 5 states. [2019-10-07 13:49:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,061 INFO L93 Difference]: Finished difference Result 715 states and 953 transitions. [2019-10-07 13:49:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:01,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-07 13:49:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,066 INFO L225 Difference]: With dead ends: 715 [2019-10-07 13:49:01,066 INFO L226 Difference]: Without dead ends: 685 [2019-10-07 13:49:01,067 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-07 13:49:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 606. [2019-10-07 13:49:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-07 13:49:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2019-10-07 13:49:01,110 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 43 [2019-10-07 13:49:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,110 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2019-10-07 13:49:01,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2019-10-07 13:49:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:49:01,112 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,112 INFO L385 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-10-07 13:49:01,112 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash -456522929, now seen corresponding path program 1 times [2019-10-07 13:49:01,113 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,113 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,113 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,113 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:01,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,153 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:01,153 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:01,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:01,154 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand 3 states. [2019-10-07 13:49:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,260 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2019-10-07 13:49:01,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:01,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 13:49:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,265 INFO L225 Difference]: With dead ends: 631 [2019-10-07 13:49:01,266 INFO L226 Difference]: Without dead ends: 624 [2019-10-07 13:49:01,267 INFO L606 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-10-07 13:49:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-07 13:49:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2019-10-07 13:49:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-07 13:49:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 825 transitions. [2019-10-07 13:49:01,318 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 825 transitions. Word has length 45 [2019-10-07 13:49:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,318 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 825 transitions. [2019-10-07 13:49:01,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 825 transitions. [2019-10-07 13:49:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:01,320 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,321 INFO L385 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] [2019-10-07 13:49:01,321 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash -185372726, now seen corresponding path program 1 times [2019-10-07 13:49:01,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:01,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,376 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:01,376 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:01,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:01,377 INFO L87 Difference]: Start difference. First operand 622 states and 825 transitions. Second operand 3 states. [2019-10-07 13:49:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,448 INFO L93 Difference]: Finished difference Result 791 states and 1043 transitions. [2019-10-07 13:49:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:01,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-07 13:49:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,452 INFO L225 Difference]: With dead ends: 791 [2019-10-07 13:49:01,452 INFO L226 Difference]: Without dead ends: 598 [2019-10-07 13:49:01,453 INFO L606 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-10-07 13:49:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-07 13:49:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-07 13:49:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-07 13:49:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 792 transitions. [2019-10-07 13:49:01,496 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 792 transitions. Word has length 50 [2019-10-07 13:49:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,497 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 792 transitions. [2019-10-07 13:49:01,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 792 transitions. [2019-10-07 13:49:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:01,499 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,499 INFO L385 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] [2019-10-07 13:49:01,499 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -397376972, now seen corresponding path program 1 times [2019-10-07 13:49:01,500 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,500 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,500 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,500 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:01,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,645 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:01,646 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:01,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:01,647 INFO L87 Difference]: Start difference. First operand 598 states and 792 transitions. Second operand 13 states. [2019-10-07 13:49:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:03,507 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2019-10-07 13:49:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:03,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-07 13:49:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:03,512 INFO L225 Difference]: With dead ends: 628 [2019-10-07 13:49:03,512 INFO L226 Difference]: Without dead ends: 622 [2019-10-07 13:49:03,513 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:49:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-07 13:49:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 598. [2019-10-07 13:49:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-07 13:49:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 791 transitions. [2019-10-07 13:49:03,553 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 791 transitions. Word has length 47 [2019-10-07 13:49:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:03,553 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 791 transitions. [2019-10-07 13:49:03,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 791 transitions. [2019-10-07 13:49:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:49:03,556 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:03,556 INFO L385 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] [2019-10-07 13:49:03,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 878367500, now seen corresponding path program 1 times [2019-10-07 13:49:03,557 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:03,557 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:03,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,639 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:03,639 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:03,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:03,640 INFO L87 Difference]: Start difference. First operand 598 states and 791 transitions. Second operand 9 states. [2019-10-07 13:49:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:03,801 INFO L93 Difference]: Finished difference Result 622 states and 817 transitions. [2019-10-07 13:49:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:03,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-07 13:49:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:03,807 INFO L225 Difference]: With dead ends: 622 [2019-10-07 13:49:03,807 INFO L226 Difference]: Without dead ends: 593 [2019-10-07 13:49:03,808 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-07 13:49:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-07 13:49:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-07 13:49:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 774 transitions. [2019-10-07 13:49:03,852 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 774 transitions. Word has length 48 [2019-10-07 13:49:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:03,852 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 774 transitions. [2019-10-07 13:49:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 774 transitions. [2019-10-07 13:49:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:03,857 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:03,857 INFO L385 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] [2019-10-07 13:49:03,857 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1711324058, now seen corresponding path program 1 times [2019-10-07 13:49:03,858 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:03,858 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:03,944 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,945 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:03,945 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:03,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:03,946 INFO L87 Difference]: Start difference. First operand 593 states and 774 transitions. Second operand 10 states. [2019-10-07 13:49:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,171 INFO L93 Difference]: Finished difference Result 609 states and 791 transitions. [2019-10-07 13:49:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:04,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-07 13:49:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,176 INFO L225 Difference]: With dead ends: 609 [2019-10-07 13:49:04,177 INFO L226 Difference]: Without dead ends: 591 [2019-10-07 13:49:04,178 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-07 13:49:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-07 13:49:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-07 13:49:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-10-07 13:49:04,253 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 50 [2019-10-07 13:49:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,254 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-10-07 13:49:04,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-10-07 13:49:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:04,256 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,256 INFO L385 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] [2019-10-07 13:49:04,256 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash 211323632, now seen corresponding path program 1 times [2019-10-07 13:49:04,257 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,257 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,257 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,257 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:04,362 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,362 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:04,363 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:04,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:04,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:04,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:04,364 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 11 states. [2019-10-07 13:49:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,585 INFO L93 Difference]: Finished difference Result 607 states and 787 transitions. [2019-10-07 13:49:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:04,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-07 13:49:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,588 INFO L225 Difference]: With dead ends: 607 [2019-10-07 13:49:04,589 INFO L226 Difference]: Without dead ends: 589 [2019-10-07 13:49:04,589 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-07 13:49:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-07 13:49:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-07 13:49:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 766 transitions. [2019-10-07 13:49:04,627 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 766 transitions. Word has length 50 [2019-10-07 13:49:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,627 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 766 transitions. [2019-10-07 13:49:04,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 766 transitions. [2019-10-07 13:49:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:49:04,629 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,630 INFO L385 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] [2019-10-07 13:49:04,630 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1636630726, now seen corresponding path program 1 times [2019-10-07 13:49:04,630 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,630 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,631 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,631 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:04,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,705 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:04,705 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:04,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:04,707 INFO L87 Difference]: Start difference. First operand 589 states and 766 transitions. Second operand 10 states. [2019-10-07 13:49:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,886 INFO L93 Difference]: Finished difference Result 602 states and 780 transitions. [2019-10-07 13:49:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:04,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-07 13:49:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,891 INFO L225 Difference]: With dead ends: 602 [2019-10-07 13:49:04,892 INFO L226 Difference]: Without dead ends: 584 [2019-10-07 13:49:04,892 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-07 13:49:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-07 13:49:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-07 13:49:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 759 transitions. [2019-10-07 13:49:04,930 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 759 transitions. Word has length 49 [2019-10-07 13:49:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,930 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 759 transitions. [2019-10-07 13:49:04,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 759 transitions. [2019-10-07 13:49:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:04,932 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,933 INFO L385 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] [2019-10-07 13:49:04,933 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -572398302, now seen corresponding path program 1 times [2019-10-07 13:49:04,933 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,933 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:05,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,078 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:05,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:05,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:05,080 INFO L87 Difference]: Start difference. First operand 584 states and 759 transitions. Second operand 12 states. [2019-10-07 13:49:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:05,311 INFO L93 Difference]: Finished difference Result 609 states and 786 transitions. [2019-10-07 13:49:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:05,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-07 13:49:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,314 INFO L225 Difference]: With dead ends: 609 [2019-10-07 13:49:05,314 INFO L226 Difference]: Without dead ends: 586 [2019-10-07 13:49:05,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-07 13:49:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-10-07 13:49:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-07 13:49:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 755 transitions. [2019-10-07 13:49:05,354 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 755 transitions. Word has length 54 [2019-10-07 13:49:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,354 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 755 transitions. [2019-10-07 13:49:05,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 755 transitions. [2019-10-07 13:49:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:49:05,356 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,356 INFO L385 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-10-07 13:49:05,357 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash 916624012, now seen corresponding path program 1 times [2019-10-07 13:49:05,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,357 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:05,470 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,471 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:05,471 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:05,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:05,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:05,473 INFO L87 Difference]: Start difference. First operand 582 states and 755 transitions. Second operand 12 states. [2019-10-07 13:49:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:05,863 INFO L93 Difference]: Finished difference Result 607 states and 782 transitions. [2019-10-07 13:49:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:05,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-07 13:49:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,867 INFO L225 Difference]: With dead ends: 607 [2019-10-07 13:49:05,867 INFO L226 Difference]: Without dead ends: 584 [2019-10-07 13:49:05,868 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-07 13:49:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-10-07 13:49:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-07 13:49:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 751 transitions. [2019-10-07 13:49:05,911 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 751 transitions. Word has length 53 [2019-10-07 13:49:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 751 transitions. [2019-10-07 13:49:05,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 751 transitions. [2019-10-07 13:49:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:05,914 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,914 INFO L385 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] [2019-10-07 13:49:05,914 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 911278729, now seen corresponding path program 1 times [2019-10-07 13:49:05,915 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,915 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,915 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,915 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:06,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-10-07 13:49:06,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,046 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:06,046 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:06,047 INFO L87 Difference]: Start difference. First operand 580 states and 751 transitions. Second operand 12 states. [2019-10-07 13:49:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:06,316 INFO L93 Difference]: Finished difference Result 603 states and 776 transitions. [2019-10-07 13:49:06,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:06,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-07 13:49:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:06,320 INFO L225 Difference]: With dead ends: 603 [2019-10-07 13:49:06,321 INFO L226 Difference]: Without dead ends: 579 [2019-10-07 13:49:06,322 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-07 13:49:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-07 13:49:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 13:49:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 740 transitions. [2019-10-07 13:49:06,380 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 740 transitions. Word has length 51 [2019-10-07 13:49:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:06,380 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 740 transitions. [2019-10-07 13:49:06,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 740 transitions. [2019-10-07 13:49:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:49:06,382 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:06,383 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:06,383 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:06,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash -717200375, now seen corresponding path program 1 times [2019-10-07 13:49:06,383 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:06,383 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:06,450 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,450 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:06,450 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:06,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:06,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:06,453 INFO L87 Difference]: Start difference. First operand 579 states and 740 transitions. Second operand 5 states. [2019-10-07 13:49:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:06,966 INFO L93 Difference]: Finished difference Result 872 states and 1122 transitions. [2019-10-07 13:49:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:06,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-07 13:49:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:06,969 INFO L225 Difference]: With dead ends: 872 [2019-10-07 13:49:06,969 INFO L226 Difference]: Without dead ends: 579 [2019-10-07 13:49:06,970 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-07 13:49:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-07 13:49:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-07 13:49:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 13:49:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 732 transitions. [2019-10-07 13:49:07,008 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 732 transitions. Word has length 63 [2019-10-07 13:49:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:07,009 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 732 transitions. [2019-10-07 13:49:07,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 732 transitions. [2019-10-07 13:49:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:07,011 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:07,011 INFO L385 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] [2019-10-07 13:49:07,011 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash -126879601, now seen corresponding path program 1 times [2019-10-07 13:49:07,012 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:07,012 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:07,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:07,081 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:07,081 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:07,081 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:07,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:07,082 INFO L87 Difference]: Start difference. First operand 579 states and 732 transitions. Second operand 5 states. [2019-10-07 13:49:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:07,890 INFO L93 Difference]: Finished difference Result 953 states and 1240 transitions. [2019-10-07 13:49:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:07,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-07 13:49:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:07,895 INFO L225 Difference]: With dead ends: 953 [2019-10-07 13:49:07,895 INFO L226 Difference]: Without dead ends: 828 [2019-10-07 13:49:07,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-07 13:49:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 610. [2019-10-07 13:49:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-07 13:49:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 773 transitions. [2019-10-07 13:49:07,944 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 773 transitions. Word has length 54 [2019-10-07 13:49:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:07,945 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 773 transitions. [2019-10-07 13:49:07,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 773 transitions. [2019-10-07 13:49:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:07,948 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:07,948 INFO L385 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] [2019-10-07 13:49:07,948 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash -264370587, now seen corresponding path program 1 times [2019-10-07 13:49:07,948 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:07,949 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:07,949 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,949 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:08,026 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,026 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:08,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:08,027 INFO L87 Difference]: Start difference. First operand 610 states and 773 transitions. Second operand 9 states. [2019-10-07 13:49:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,180 INFO L93 Difference]: Finished difference Result 634 states and 799 transitions. [2019-10-07 13:49:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:08,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-07 13:49:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,184 INFO L225 Difference]: With dead ends: 634 [2019-10-07 13:49:08,185 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 13:49:08,185 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 13:49:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-07 13:49:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-07 13:49:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 725 transitions. [2019-10-07 13:49:08,225 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 725 transitions. Word has length 51 [2019-10-07 13:49:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,225 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 725 transitions. [2019-10-07 13:49:08,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 725 transitions. [2019-10-07 13:49:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:08,227 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,227 INFO L385 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] [2019-10-07 13:49:08,228 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash -678859389, now seen corresponding path program 1 times [2019-10-07 13:49:08,228 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,228 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:08,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,325 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,325 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:08,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:08,326 INFO L87 Difference]: Start difference. First operand 583 states and 725 transitions. Second operand 11 states. [2019-10-07 13:49:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,452 INFO L93 Difference]: Finished difference Result 644 states and 804 transitions. [2019-10-07 13:49:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:08,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-07 13:49:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,456 INFO L225 Difference]: With dead ends: 644 [2019-10-07 13:49:08,456 INFO L226 Difference]: Without dead ends: 593 [2019-10-07 13:49:08,457 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-07 13:49:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2019-10-07 13:49:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-07 13:49:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 742 transitions. [2019-10-07 13:49:08,498 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 742 transitions. Word has length 54 [2019-10-07 13:49:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,498 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 742 transitions. [2019-10-07 13:49:08,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 742 transitions. [2019-10-07 13:49:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 13:49:08,500 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,501 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:08,501 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 750568491, now seen corresponding path program 1 times [2019-10-07 13:49:08,501 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,501 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:08,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,541 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:08,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:08,541 INFO L87 Difference]: Start difference. First operand 587 states and 742 transitions. Second operand 3 states. [2019-10-07 13:49:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,579 INFO L93 Difference]: Finished difference Result 717 states and 897 transitions. [2019-10-07 13:49:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:08,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-07 13:49:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,583 INFO L225 Difference]: With dead ends: 717 [2019-10-07 13:49:08,583 INFO L226 Difference]: Without dead ends: 565 [2019-10-07 13:49:08,584 INFO L606 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-10-07 13:49:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-07 13:49:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2019-10-07 13:49:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-07 13:49:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 705 transitions. [2019-10-07 13:49:08,623 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 705 transitions. Word has length 68 [2019-10-07 13:49:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,624 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 705 transitions. [2019-10-07 13:49:08,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 705 transitions. [2019-10-07 13:49:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:49:08,626 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,626 INFO L385 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] [2019-10-07 13:49:08,627 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash 876079827, now seen corresponding path program 1 times [2019-10-07 13:49:08,627 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,627 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,627 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:08,768 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,768 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,768 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:08,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:08,769 INFO L87 Difference]: Start difference. First operand 563 states and 705 transitions. Second operand 14 states. [2019-10-07 13:49:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:09,362 INFO L93 Difference]: Finished difference Result 605 states and 755 transitions. [2019-10-07 13:49:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:49:09,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-07 13:49:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:09,366 INFO L225 Difference]: With dead ends: 605 [2019-10-07 13:49:09,366 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 13:49:09,366 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:49:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 13:49:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 567. [2019-10-07 13:49:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-07 13:49:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 711 transitions. [2019-10-07 13:49:09,412 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 711 transitions. Word has length 55 [2019-10-07 13:49:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:09,412 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 711 transitions. [2019-10-07 13:49:09,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 711 transitions. [2019-10-07 13:49:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:49:09,415 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:09,415 INFO L385 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] [2019-10-07 13:49:09,415 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1672905161, now seen corresponding path program 1 times [2019-10-07 13:49:09,416 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:09,416 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:09,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,524 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:09,524 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:09,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:09,525 INFO L87 Difference]: Start difference. First operand 567 states and 711 transitions. Second operand 13 states. [2019-10-07 13:49:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:09,786 INFO L93 Difference]: Finished difference Result 583 states and 728 transitions. [2019-10-07 13:49:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:09,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-07 13:49:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:09,790 INFO L225 Difference]: With dead ends: 583 [2019-10-07 13:49:09,790 INFO L226 Difference]: Without dead ends: 562 [2019-10-07 13:49:09,791 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:49:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-07 13:49:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-07 13:49:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-07 13:49:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 704 transitions. [2019-10-07 13:49:09,832 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 704 transitions. Word has length 55 [2019-10-07 13:49:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:09,832 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 704 transitions. [2019-10-07 13:49:09,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 704 transitions. [2019-10-07 13:49:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:09,834 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:09,835 INFO L385 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] [2019-10-07 13:49:09,835 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2129275013, now seen corresponding path program 1 times [2019-10-07 13:49:09,835 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:09,836 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,836 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,836 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:09,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-10-07 13:49:09,925 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,925 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:09,925 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:09,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:09,926 INFO L87 Difference]: Start difference. First operand 562 states and 704 transitions. Second operand 5 states. [2019-10-07 13:49:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,428 INFO L93 Difference]: Finished difference Result 657 states and 811 transitions. [2019-10-07 13:49:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:10,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-07 13:49:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,432 INFO L225 Difference]: With dead ends: 657 [2019-10-07 13:49:10,432 INFO L226 Difference]: Without dead ends: 584 [2019-10-07 13:49:10,432 INFO L606 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-10-07 13:49:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-07 13:49:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 563. [2019-10-07 13:49:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-07 13:49:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-07 13:49:10,479 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 59 [2019-10-07 13:49:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,480 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-07 13:49:10,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-07 13:49:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:10,482 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,482 INFO L385 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] [2019-10-07 13:49:10,482 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2136791779, now seen corresponding path program 1 times [2019-10-07 13:49:10,483 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,483 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,483 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,483 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:10,582 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,582 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:10,582 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:10,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:10,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:10,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:10,583 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 11 states. [2019-10-07 13:49:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,729 INFO L93 Difference]: Finished difference Result 599 states and 743 transitions. [2019-10-07 13:49:10,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:10,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-07 13:49:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,733 INFO L225 Difference]: With dead ends: 599 [2019-10-07 13:49:10,733 INFO L226 Difference]: Without dead ends: 576 [2019-10-07 13:49:10,734 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-07 13:49:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 563. [2019-10-07 13:49:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-07 13:49:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-07 13:49:10,784 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 56 [2019-10-07 13:49:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,784 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-07 13:49:10,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-07 13:49:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:10,786 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,787 INFO L385 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] [2019-10-07 13:49:10,787 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -59246208, now seen corresponding path program 1 times [2019-10-07 13:49:10,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,787 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:10,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,817 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:10,818 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:10,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:10,819 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 3 states. [2019-10-07 13:49:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,859 INFO L93 Difference]: Finished difference Result 714 states and 878 transitions. [2019-10-07 13:49:10,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:10,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-07 13:49:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,862 INFO L225 Difference]: With dead ends: 714 [2019-10-07 13:49:10,862 INFO L226 Difference]: Without dead ends: 520 [2019-10-07 13:49:10,863 INFO L606 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-10-07 13:49:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-07 13:49:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 502. [2019-10-07 13:49:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-07 13:49:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 602 transitions. [2019-10-07 13:49:10,907 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 602 transitions. Word has length 56 [2019-10-07 13:49:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,907 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 602 transitions. [2019-10-07 13:49:10,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 602 transitions. [2019-10-07 13:49:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:10,909 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,910 INFO L385 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] [2019-10-07 13:49:10,910 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash -775523185, now seen corresponding path program 1 times [2019-10-07 13:49:10,911 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,911 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,074 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,074 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,075 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:11,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:11,077 INFO L87 Difference]: Start difference. First operand 502 states and 602 transitions. Second operand 13 states. [2019-10-07 13:49:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:11,334 INFO L93 Difference]: Finished difference Result 518 states and 619 transitions. [2019-10-07 13:49:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:11,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-07 13:49:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:11,337 INFO L225 Difference]: With dead ends: 518 [2019-10-07 13:49:11,337 INFO L226 Difference]: Without dead ends: 497 [2019-10-07 13:49:11,338 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:49:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-07 13:49:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-10-07 13:49:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-07 13:49:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 595 transitions. [2019-10-07 13:49:11,374 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 595 transitions. Word has length 56 [2019-10-07 13:49:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:11,374 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 595 transitions. [2019-10-07 13:49:11,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 595 transitions. [2019-10-07 13:49:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:49:11,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:11,376 INFO L385 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-10-07 13:49:11,376 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599993, now seen corresponding path program 1 times [2019-10-07 13:49:11,377 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:11,377 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,494 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,494 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,494 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:11,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:11,496 INFO L87 Difference]: Start difference. First operand 497 states and 595 transitions. Second operand 11 states. [2019-10-07 13:49:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:11,641 INFO L93 Difference]: Finished difference Result 521 states and 621 transitions. [2019-10-07 13:49:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:11,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-07 13:49:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:11,644 INFO L225 Difference]: With dead ends: 521 [2019-10-07 13:49:11,644 INFO L226 Difference]: Without dead ends: 494 [2019-10-07 13:49:11,645 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-07 13:49:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-07 13:49:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-07 13:49:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 590 transitions. [2019-10-07 13:49:11,681 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 590 transitions. Word has length 57 [2019-10-07 13:49:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:11,681 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 590 transitions. [2019-10-07 13:49:11,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 590 transitions. [2019-10-07 13:49:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:11,683 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:11,683 INFO L385 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] [2019-10-07 13:49:11,683 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash -504628611, now seen corresponding path program 1 times [2019-10-07 13:49:11,684 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:11,684 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,684 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,684 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,787 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,787 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,787 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:11,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:11,788 INFO L87 Difference]: Start difference. First operand 494 states and 590 transitions. Second operand 12 states. [2019-10-07 13:49:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,007 INFO L93 Difference]: Finished difference Result 517 states and 614 transitions. [2019-10-07 13:49:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:12,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-07 13:49:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,010 INFO L225 Difference]: With dead ends: 517 [2019-10-07 13:49:12,010 INFO L226 Difference]: Without dead ends: 494 [2019-10-07 13:49:12,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-07 13:49:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2019-10-07 13:49:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-07 13:49:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 586 transitions. [2019-10-07 13:49:12,043 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 586 transitions. Word has length 59 [2019-10-07 13:49:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,043 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 586 transitions. [2019-10-07 13:49:12,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 586 transitions. [2019-10-07 13:49:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:12,044 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,045 INFO L385 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] [2019-10-07 13:49:12,045 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1947857079, now seen corresponding path program 1 times [2019-10-07 13:49:12,045 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,045 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:12,245 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,245 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:12,245 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:12,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:12,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:12,247 INFO L87 Difference]: Start difference. First operand 492 states and 586 transitions. Second operand 14 states. [2019-10-07 13:49:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,470 INFO L93 Difference]: Finished difference Result 517 states and 613 transitions. [2019-10-07 13:49:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:12,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-10-07 13:49:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,473 INFO L225 Difference]: With dead ends: 517 [2019-10-07 13:49:12,473 INFO L226 Difference]: Without dead ends: 491 [2019-10-07 13:49:12,474 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-07 13:49:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2019-10-07 13:49:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-07 13:49:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 581 transitions. [2019-10-07 13:49:12,511 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 581 transitions. Word has length 59 [2019-10-07 13:49:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,511 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 581 transitions. [2019-10-07 13:49:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 581 transitions. [2019-10-07 13:49:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:12,513 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,513 INFO L385 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] [2019-10-07 13:49:12,513 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1680440093, now seen corresponding path program 1 times [2019-10-07 13:49:12,514 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,514 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:12,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,663 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:12,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:12,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:12,666 INFO L87 Difference]: Start difference. First operand 489 states and 581 transitions. Second operand 14 states. [2019-10-07 13:49:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,912 INFO L93 Difference]: Finished difference Result 514 states and 608 transitions. [2019-10-07 13:49:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:12,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,915 INFO L225 Difference]: With dead ends: 514 [2019-10-07 13:49:12,915 INFO L226 Difference]: Without dead ends: 486 [2019-10-07 13:49:12,915 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-10-07 13:49:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2019-10-07 13:49:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-07 13:49:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 574 transitions. [2019-10-07 13:49:12,957 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 574 transitions. Word has length 60 [2019-10-07 13:49:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,958 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 574 transitions. [2019-10-07 13:49:12,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 574 transitions. [2019-10-07 13:49:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 13:49:12,961 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,961 INFO L385 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-10-07 13:49:12,961 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1499433800, now seen corresponding path program 1 times [2019-10-07 13:49:12,962 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,962 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,962 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,962 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:13,090 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,090 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,091 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:13,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:13,091 INFO L87 Difference]: Start difference. First operand 484 states and 574 transitions. Second operand 12 states. [2019-10-07 13:49:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:13,259 INFO L93 Difference]: Finished difference Result 505 states and 596 transitions. [2019-10-07 13:49:13,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:13,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-07 13:49:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:13,262 INFO L225 Difference]: With dead ends: 505 [2019-10-07 13:49:13,262 INFO L226 Difference]: Without dead ends: 482 [2019-10-07 13:49:13,262 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-07 13:49:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-07 13:49:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-07 13:49:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 570 transitions. [2019-10-07 13:49:13,298 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 570 transitions. Word has length 58 [2019-10-07 13:49:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,299 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 570 transitions. [2019-10-07 13:49:13,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 570 transitions. [2019-10-07 13:49:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:13,301 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,301 INFO L385 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] [2019-10-07 13:49:13,301 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash -913481009, now seen corresponding path program 1 times [2019-10-07 13:49:13,302 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,302 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,302 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,302 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:13,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,406 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,406 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:13,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:13,407 INFO L87 Difference]: Start difference. First operand 482 states and 570 transitions. Second operand 11 states. [2019-10-07 13:49:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:13,532 INFO L93 Difference]: Finished difference Result 506 states and 596 transitions. [2019-10-07 13:49:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:13,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-07 13:49:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:13,535 INFO L225 Difference]: With dead ends: 506 [2019-10-07 13:49:13,535 INFO L226 Difference]: Without dead ends: 479 [2019-10-07 13:49:13,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-07 13:49:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-07 13:49:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-07 13:49:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 565 transitions. [2019-10-07 13:49:13,570 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 565 transitions. Word has length 59 [2019-10-07 13:49:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,571 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 565 transitions. [2019-10-07 13:49:13,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 565 transitions. [2019-10-07 13:49:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:13,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,573 INFO L385 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] [2019-10-07 13:49:13,573 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1741479821, now seen corresponding path program 1 times [2019-10-07 13:49:13,574 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,574 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:13,707 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,707 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,707 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:13,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:13,708 INFO L87 Difference]: Start difference. First operand 479 states and 565 transitions. Second operand 14 states. [2019-10-07 13:49:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:13,905 INFO L93 Difference]: Finished difference Result 502 states and 590 transitions. [2019-10-07 13:49:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:13,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:13,908 INFO L225 Difference]: With dead ends: 502 [2019-10-07 13:49:13,908 INFO L226 Difference]: Without dead ends: 476 [2019-10-07 13:49:13,909 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-07 13:49:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-07 13:49:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-07 13:49:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 560 transitions. [2019-10-07 13:49:13,942 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 560 transitions. Word has length 60 [2019-10-07 13:49:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,942 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 560 transitions. [2019-10-07 13:49:13,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 560 transitions. [2019-10-07 13:49:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:13,944 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,944 INFO L385 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] [2019-10-07 13:49:13,944 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1493575287, now seen corresponding path program 1 times [2019-10-07 13:49:13,945 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,945 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,945 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,945 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,084 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,084 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,084 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:14,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:14,085 INFO L87 Difference]: Start difference. First operand 476 states and 560 transitions. Second operand 14 states. [2019-10-07 13:49:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,289 INFO L93 Difference]: Finished difference Result 499 states and 585 transitions. [2019-10-07 13:49:14,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:14,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,292 INFO L225 Difference]: With dead ends: 499 [2019-10-07 13:49:14,293 INFO L226 Difference]: Without dead ends: 474 [2019-10-07 13:49:14,293 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-07 13:49:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-07 13:49:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-07 13:49:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 556 transitions. [2019-10-07 13:49:14,327 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 556 transitions. Word has length 60 [2019-10-07 13:49:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:14,327 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 556 transitions. [2019-10-07 13:49:14,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 556 transitions. [2019-10-07 13:49:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:14,329 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:14,329 INFO L385 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] [2019-10-07 13:49:14,329 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 604665947, now seen corresponding path program 1 times [2019-10-07 13:49:14,330 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:14,330 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,433 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,433 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,433 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:14,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:14,434 INFO L87 Difference]: Start difference. First operand 474 states and 556 transitions. Second operand 11 states. [2019-10-07 13:49:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,576 INFO L93 Difference]: Finished difference Result 498 states and 582 transitions. [2019-10-07 13:49:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:14,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-07 13:49:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,580 INFO L225 Difference]: With dead ends: 498 [2019-10-07 13:49:14,580 INFO L226 Difference]: Without dead ends: 472 [2019-10-07 13:49:14,581 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-07 13:49:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-10-07 13:49:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-07 13:49:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 552 transitions. [2019-10-07 13:49:14,632 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 552 transitions. Word has length 60 [2019-10-07 13:49:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:14,632 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 552 transitions. [2019-10-07 13:49:14,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 552 transitions. [2019-10-07 13:49:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 13:49:14,634 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:14,634 INFO L385 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] [2019-10-07 13:49:14,634 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -640615229, now seen corresponding path program 1 times [2019-10-07 13:49:14,635 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:14,635 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,635 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,636 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,769 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,769 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,769 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:14,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:14,770 INFO L87 Difference]: Start difference. First operand 472 states and 552 transitions. Second operand 11 states. [2019-10-07 13:49:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,960 INFO L93 Difference]: Finished difference Result 482 states and 561 transitions. [2019-10-07 13:49:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:14,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-10-07 13:49:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,963 INFO L225 Difference]: With dead ends: 482 [2019-10-07 13:49:14,963 INFO L226 Difference]: Without dead ends: 476 [2019-10-07 13:49:14,964 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-07 13:49:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-10-07 13:49:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-07 13:49:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 547 transitions. [2019-10-07 13:49:15,000 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 547 transitions. Word has length 61 [2019-10-07 13:49:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,000 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 547 transitions. [2019-10-07 13:49:15,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 547 transitions. [2019-10-07 13:49:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 13:49:15,002 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,002 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:15,003 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 934869385, now seen corresponding path program 1 times [2019-10-07 13:49:15,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:49:15,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,172 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:15,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:15,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:15,173 INFO L87 Difference]: Start difference. First operand 470 states and 547 transitions. Second operand 6 states. [2019-10-07 13:49:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:15,256 INFO L93 Difference]: Finished difference Result 541 states and 628 transitions. [2019-10-07 13:49:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:15,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-10-07 13:49:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:15,259 INFO L225 Difference]: With dead ends: 541 [2019-10-07 13:49:15,259 INFO L226 Difference]: Without dead ends: 468 [2019-10-07 13:49:15,260 INFO L606 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-10-07 13:49:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-10-07 13:49:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2019-10-07 13:49:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-07 13:49:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 544 transitions. [2019-10-07 13:49:15,330 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 544 transitions. Word has length 76 [2019-10-07 13:49:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,330 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 544 transitions. [2019-10-07 13:49:15,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 544 transitions. [2019-10-07 13:49:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:49:15,333 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,333 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:15,334 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash 838416403, now seen corresponding path program 1 times [2019-10-07 13:49:15,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,335 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,335 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,335 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:15,462 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,462 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:15,463 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:15,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:15,463 INFO L87 Difference]: Start difference. First operand 468 states and 544 transitions. Second operand 11 states. [2019-10-07 13:49:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:15,607 INFO L93 Difference]: Finished difference Result 492 states and 570 transitions. [2019-10-07 13:49:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:15,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-07 13:49:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:15,610 INFO L225 Difference]: With dead ends: 492 [2019-10-07 13:49:15,610 INFO L226 Difference]: Without dead ends: 461 [2019-10-07 13:49:15,612 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-07 13:49:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-10-07 13:49:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-07 13:49:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 533 transitions. [2019-10-07 13:49:15,661 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 533 transitions. Word has length 63 [2019-10-07 13:49:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,661 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 533 transitions. [2019-10-07 13:49:15,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 533 transitions. [2019-10-07 13:49:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:15,664 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,664 INFO L385 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-10-07 13:49:15,664 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 910840807, now seen corresponding path program 1 times [2019-10-07 13:49:15,665 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,665 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:15,769 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,770 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:15,770 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:15,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:15,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:15,771 INFO L87 Difference]: Start difference. First operand 461 states and 533 transitions. Second operand 11 states. [2019-10-07 13:49:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:15,922 INFO L93 Difference]: Finished difference Result 485 states and 559 transitions. [2019-10-07 13:49:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:15,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:49:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:15,925 INFO L225 Difference]: With dead ends: 485 [2019-10-07 13:49:15,925 INFO L226 Difference]: Without dead ends: 456 [2019-10-07 13:49:15,926 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-07 13:49:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-07 13:49:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-07 13:49:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 526 transitions. [2019-10-07 13:49:15,981 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 526 transitions. Word has length 62 [2019-10-07 13:49:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,982 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 526 transitions. [2019-10-07 13:49:15,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 526 transitions. [2019-10-07 13:49:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:15,983 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,983 INFO L385 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-10-07 13:49:15,983 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash 975167058, now seen corresponding path program 1 times [2019-10-07 13:49:15,984 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,984 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:16,041 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:16,041 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:16,042 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:16,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:16,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:16,043 INFO L87 Difference]: Start difference. First operand 456 states and 526 transitions. Second operand 5 states. [2019-10-07 13:49:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:16,436 INFO L93 Difference]: Finished difference Result 500 states and 579 transitions. [2019-10-07 13:49:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:16,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 13:49:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:16,438 INFO L225 Difference]: With dead ends: 500 [2019-10-07 13:49:16,438 INFO L226 Difference]: Without dead ends: 454 [2019-10-07 13:49:16,438 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-07 13:49:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 416. [2019-10-07 13:49:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-07 13:49:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 477 transitions. [2019-10-07 13:49:16,484 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 477 transitions. Word has length 62 [2019-10-07 13:49:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:16,484 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 477 transitions. [2019-10-07 13:49:16,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 477 transitions. [2019-10-07 13:49:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:49:16,486 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:16,486 INFO L385 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-10-07 13:49:16,486 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2064467391, now seen corresponding path program 1 times [2019-10-07 13:49:16,487 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:16,487 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:16,487 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,487 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:16,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:16,616 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:16,617 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:16,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:16,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:16,618 INFO L87 Difference]: Start difference. First operand 416 states and 477 transitions. Second operand 13 states. [2019-10-07 13:49:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:16,892 INFO L93 Difference]: Finished difference Result 435 states and 497 transitions. [2019-10-07 13:49:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:16,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-10-07 13:49:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:16,895 INFO L225 Difference]: With dead ends: 435 [2019-10-07 13:49:16,895 INFO L226 Difference]: Without dead ends: 414 [2019-10-07 13:49:16,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:49:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-10-07 13:49:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-10-07 13:49:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-10-07 13:49:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 473 transitions. [2019-10-07 13:49:16,929 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 473 transitions. Word has length 65 [2019-10-07 13:49:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:16,929 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 473 transitions. [2019-10-07 13:49:16,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 473 transitions. [2019-10-07 13:49:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:16,931 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:16,931 INFO L385 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-10-07 13:49:16,931 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1109409121, now seen corresponding path program 1 times [2019-10-07 13:49:16,932 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:16,932 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:16,932 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,932 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:17,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:17,082 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:17,082 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:17,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:17,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:17,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:17,083 INFO L87 Difference]: Start difference. First operand 414 states and 473 transitions. Second operand 13 states. [2019-10-07 13:49:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:17,319 INFO L93 Difference]: Finished difference Result 430 states and 490 transitions. [2019-10-07 13:49:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:17,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-07 13:49:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:17,321 INFO L225 Difference]: With dead ends: 430 [2019-10-07 13:49:17,321 INFO L226 Difference]: Without dead ends: 399 [2019-10-07 13:49:17,322 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:49:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-07 13:49:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-07 13:49:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-07 13:49:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 454 transitions. [2019-10-07 13:49:17,355 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 454 transitions. Word has length 62 [2019-10-07 13:49:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:17,357 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 454 transitions. [2019-10-07 13:49:17,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 454 transitions. [2019-10-07 13:49:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 13:49:17,358 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:17,358 INFO L385 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] [2019-10-07 13:49:17,359 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1424397859, now seen corresponding path program 1 times [2019-10-07 13:49:17,359 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:17,360 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:17,360 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:17,360 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:17,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-10-07 13:49:17,502 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:17,502 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:17,502 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:17,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:17,503 INFO L87 Difference]: Start difference. First operand 399 states and 454 transitions. Second operand 14 states. [2019-10-07 13:49:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:17,712 INFO L93 Difference]: Finished difference Result 459 states and 519 transitions. [2019-10-07 13:49:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:17,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-10-07 13:49:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:17,715 INFO L225 Difference]: With dead ends: 459 [2019-10-07 13:49:17,715 INFO L226 Difference]: Without dead ends: 400 [2019-10-07 13:49:17,715 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-10-07 13:49:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2019-10-07 13:49:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-07 13:49:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 447 transitions. [2019-10-07 13:49:17,744 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 447 transitions. Word has length 68 [2019-10-07 13:49:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:17,745 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 447 transitions. [2019-10-07 13:49:17,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 447 transitions. [2019-10-07 13:49:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:49:17,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:17,746 INFO L385 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-10-07 13:49:17,746 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2111804080, now seen corresponding path program 1 times [2019-10-07 13:49:17,747 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:17,747 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:17,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:17,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:17,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:17,895 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:17,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:17,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:17,896 INFO L87 Difference]: Start difference. First operand 396 states and 447 transitions. Second operand 14 states. [2019-10-07 13:49:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:18,140 INFO L93 Difference]: Finished difference Result 447 states and 500 transitions. [2019-10-07 13:49:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:18,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-10-07 13:49:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:18,142 INFO L225 Difference]: With dead ends: 447 [2019-10-07 13:49:18,143 INFO L226 Difference]: Without dead ends: 386 [2019-10-07 13:49:18,143 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-07 13:49:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2019-10-07 13:49:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-10-07 13:49:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 432 transitions. [2019-10-07 13:49:18,174 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 432 transitions. Word has length 65 [2019-10-07 13:49:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:18,174 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 432 transitions. [2019-10-07 13:49:18,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 432 transitions. [2019-10-07 13:49:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:49:18,175 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:18,175 INFO L385 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-10-07 13:49:18,176 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1108084445, now seen corresponding path program 1 times [2019-10-07 13:49:18,176 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:18,176 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:18,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:18,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:18,289 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:18,289 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:18,289 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:18,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:18,290 INFO L87 Difference]: Start difference. First operand 386 states and 432 transitions. Second operand 11 states. [2019-10-07 13:49:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:18,862 INFO L93 Difference]: Finished difference Result 479 states and 529 transitions. [2019-10-07 13:49:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:18,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-07 13:49:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:18,864 INFO L225 Difference]: With dead ends: 479 [2019-10-07 13:49:18,864 INFO L226 Difference]: Without dead ends: 411 [2019-10-07 13:49:18,864 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-10-07 13:49:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-07 13:49:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 390. [2019-10-07 13:49:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-07 13:49:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 434 transitions. [2019-10-07 13:49:18,890 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 434 transitions. Word has length 65 [2019-10-07 13:49:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 434 transitions. [2019-10-07 13:49:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 434 transitions. [2019-10-07 13:49:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 13:49:18,891 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:18,891 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:18,891 INFO L410 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -63619198, now seen corresponding path program 1 times [2019-10-07 13:49:18,892 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:18,892 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:18,892 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:18,892 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:49:18,953 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:18,953 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:18,953 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:18,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:18,954 INFO L87 Difference]: Start difference. First operand 390 states and 434 transitions. Second operand 5 states. [2019-10-07 13:49:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:19,215 INFO L93 Difference]: Finished difference Result 454 states and 508 transitions. [2019-10-07 13:49:19,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:19,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-07 13:49:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:19,217 INFO L225 Difference]: With dead ends: 454 [2019-10-07 13:49:19,218 INFO L226 Difference]: Without dead ends: 379 [2019-10-07 13:49:19,218 INFO L606 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-10-07 13:49:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-07 13:49:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-10-07 13:49:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-07 13:49:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 422 transitions. [2019-10-07 13:49:19,259 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 422 transitions. Word has length 80 [2019-10-07 13:49:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:19,259 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 422 transitions. [2019-10-07 13:49:19,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 422 transitions. [2019-10-07 13:49:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 13:49:19,261 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:19,261 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:19,261 INFO L410 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash -980028311, now seen corresponding path program 1 times [2019-10-07 13:49:19,262 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:19,262 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:19,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:19,352 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:19,352 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:19,352 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:19,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:19,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:19,353 INFO L87 Difference]: Start difference. First operand 379 states and 422 transitions. Second operand 6 states. [2019-10-07 13:49:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:19,769 INFO L93 Difference]: Finished difference Result 446 states and 493 transitions. [2019-10-07 13:49:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:19,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-10-07 13:49:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:19,772 INFO L225 Difference]: With dead ends: 446 [2019-10-07 13:49:19,772 INFO L226 Difference]: Without dead ends: 443 [2019-10-07 13:49:19,772 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-07 13:49:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 348. [2019-10-07 13:49:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-07 13:49:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 381 transitions. [2019-10-07 13:49:19,801 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 381 transitions. Word has length 81 [2019-10-07 13:49:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:19,802 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 381 transitions. [2019-10-07 13:49:19,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 381 transitions. [2019-10-07 13:49:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:49:19,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:19,803 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:19,804 INFO L410 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash -712418324, now seen corresponding path program 1 times [2019-10-07 13:49:19,804 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:19,804 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:19,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:49:19,911 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:19,912 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:19,912 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:19,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:19,913 INFO L87 Difference]: Start difference. First operand 348 states and 381 transitions. Second operand 13 states. [2019-10-07 13:49:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:19,965 INFO L93 Difference]: Finished difference Result 376 states and 407 transitions. [2019-10-07 13:49:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:19,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-10-07 13:49:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:19,966 INFO L225 Difference]: With dead ends: 376 [2019-10-07 13:49:19,966 INFO L226 Difference]: Without dead ends: 334 [2019-10-07 13:49:19,966 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-07 13:49:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 323. [2019-10-07 13:49:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-07 13:49:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 351 transitions. [2019-10-07 13:49:19,994 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 351 transitions. Word has length 67 [2019-10-07 13:49:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:19,995 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 351 transitions. [2019-10-07 13:49:19,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 351 transitions. [2019-10-07 13:49:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 13:49:19,996 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:19,996 INFO L385 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] [2019-10-07 13:49:19,996 INFO L410 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 122757227, now seen corresponding path program 1 times [2019-10-07 13:49:19,997 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:19,997 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:19,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:20,090 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,091 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:20,091 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:20,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:20,092 INFO L87 Difference]: Start difference. First operand 323 states and 351 transitions. Second operand 7 states. [2019-10-07 13:49:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:20,194 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2019-10-07 13:49:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:20,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-10-07 13:49:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:20,195 INFO L225 Difference]: With dead ends: 329 [2019-10-07 13:49:20,195 INFO L226 Difference]: Without dead ends: 237 [2019-10-07 13:49:20,196 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-07 13:49:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-10-07 13:49:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-07 13:49:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2019-10-07 13:49:20,217 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 68 [2019-10-07 13:49:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2019-10-07 13:49:20,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2019-10-07 13:49:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-07 13:49:20,219 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:20,219 INFO L385 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] [2019-10-07 13:49:20,219 INFO L410 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash -823991453, now seen corresponding path program 1 times [2019-10-07 13:49:20,219 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:20,220 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,220 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,220 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:20,372 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,374 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:20,374 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:20,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:20,375 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 14 states. [2019-10-07 13:49:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:20,530 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2019-10-07 13:49:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:20,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2019-10-07 13:49:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:20,532 INFO L225 Difference]: With dead ends: 252 [2019-10-07 13:49:20,532 INFO L226 Difference]: Without dead ends: 202 [2019-10-07 13:49:20,532 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-07 13:49:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-10-07 13:49:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-07 13:49:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 221 transitions. [2019-10-07 13:49:20,550 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 221 transitions. Word has length 69 [2019-10-07 13:49:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:20,551 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 221 transitions. [2019-10-07 13:49:20,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 221 transitions. [2019-10-07 13:49:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 13:49:20,552 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:20,552 INFO L385 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] [2019-10-07 13:49:20,552 INFO L410 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1036161316, now seen corresponding path program 1 times [2019-10-07 13:49:20,553 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:20,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:20,673 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,673 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:20,673 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:20,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:20,674 INFO L87 Difference]: Start difference. First operand 202 states and 221 transitions. Second operand 13 states. [2019-10-07 13:49:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:20,923 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2019-10-07 13:49:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:20,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-10-07 13:49:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:20,926 INFO L225 Difference]: With dead ends: 204 [2019-10-07 13:49:20,926 INFO L226 Difference]: Without dead ends: 136 [2019-10-07 13:49:20,927 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:49:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-07 13:49:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-07 13:49:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-07 13:49:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2019-10-07 13:49:20,948 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 72 [2019-10-07 13:49:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:20,948 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2019-10-07 13:49:20,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2019-10-07 13:49:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 13:49:20,950 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:20,951 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 13:49:20,951 INFO L410 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1679721348, now seen corresponding path program 1 times [2019-10-07 13:49:20,952 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:20,952 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:20,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:49:21,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:21,091 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:21,091 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:21,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:21,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:21,092 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 11 states. [2019-10-07 13:49:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:21,752 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2019-10-07 13:49:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:21,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-10-07 13:49:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:21,754 INFO L225 Difference]: With dead ends: 156 [2019-10-07 13:49:21,754 INFO L226 Difference]: Without dead ends: 111 [2019-10-07 13:49:21,755 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:49:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-07 13:49:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-07 13:49:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-07 13:49:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-10-07 13:49:21,764 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 97 [2019-10-07 13:49:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:21,764 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-10-07 13:49:21,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-10-07 13:49:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 13:49:21,765 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:21,765 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:21,765 INFO L410 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1590710500, now seen corresponding path program 1 times [2019-10-07 13:49:21,766 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:21,766 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:21,766 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:21,766 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:21,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:21,908 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:21,908 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:21,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:21,909 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 13 states. [2019-10-07 13:49:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:22,662 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2019-10-07 13:49:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:22,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-10-07 13:49:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:22,664 INFO L225 Difference]: With dead ends: 140 [2019-10-07 13:49:22,664 INFO L226 Difference]: Without dead ends: 117 [2019-10-07 13:49:22,665 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-07 13:49:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-07 13:49:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2019-10-07 13:49:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-07 13:49:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-10-07 13:49:22,675 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 87 [2019-10-07 13:49:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:22,675 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-10-07 13:49:22,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-10-07 13:49:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 13:49:22,676 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:22,676 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:22,676 INFO L410 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 227510936, now seen corresponding path program 1 times [2019-10-07 13:49:22,676 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:22,676 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:22,677 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:22,677 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:22,749 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:22,750 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:22,750 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:22,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:22,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:22,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:22,751 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 9 states. [2019-10-07 13:49:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:22,812 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-10-07 13:49:22,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:22,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-10-07 13:49:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:22,813 INFO L225 Difference]: With dead ends: 111 [2019-10-07 13:49:22,813 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:49:22,814 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:49:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:49:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:49:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:49:22,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-10-07 13:49:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:22,815 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:49:22,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:49:22,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:49:22,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:49:25,050 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 1 [2019-10-07 13:49:25,189 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:25,460 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2019-10-07 13:49:25,982 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 93 [2019-10-07 13:49:26,136 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-10-07 13:49:26,320 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-10-07 13:49:26,455 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-10-07 13:49:26,598 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:27,108 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 91 [2019-10-07 13:49:27,323 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-10-07 13:49:27,472 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:27,620 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:28,088 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 98 [2019-10-07 13:49:28,650 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 71 [2019-10-07 13:49:28,793 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-10-07 13:49:28,943 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:29,358 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 81 [2019-10-07 13:49:29,584 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-07 13:49:29,706 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-10-07 13:49:29,863 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-07 13:49:30,108 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-07 13:49:30,495 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2019-10-07 13:49:30,624 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:30,835 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 13:49:30,981 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-10-07 13:49:31,259 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-07 13:49:31,487 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:31,597 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-07 13:49:31,755 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-10-07 13:49:32,259 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-10-07 13:49:33,017 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 83 [2019-10-07 13:49:33,151 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:33,426 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-10-07 13:49:33,665 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 77 [2019-10-07 13:49:34,024 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 76 [2019-10-07 13:49:34,181 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-07 13:49:34,316 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:34,625 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-10-07 13:49:34,782 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-07 13:49:34,930 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:35,092 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:35,393 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 72 [2019-10-07 13:49:35,601 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-10-07 13:49:35,750 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:35,883 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:36,365 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2019-10-07 13:49:36,520 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:36,636 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-07 13:49:36,798 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-07 13:49:36,971 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2019-10-07 13:49:37,177 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:37,331 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-10-07 13:49:37,469 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-10-07 13:49:37,692 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:37,875 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:38,087 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-10-07 13:49:38,287 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-10-07 13:49:38,499 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-10-07 13:49:38,715 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:38,841 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-10-07 13:49:38,975 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-10-07 13:49:39,186 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 13:49:39,392 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-10-07 13:49:39,536 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-10-07 13:49:39,695 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-10-07 13:49:39,844 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:40,002 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-07 13:49:40,237 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-10-07 13:49:40,370 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:40,626 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 1 [2019-10-07 13:49:40,978 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 81 [2019-10-07 13:49:41,219 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:41,854 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 91 [2019-10-07 13:49:42,037 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-07 13:49:42,177 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:42,321 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:49:42,440 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-07 13:49:42,653 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:42,872 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-07 13:49:43,015 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:43,278 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-10-07 13:49:43,496 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-10-07 13:49:43,642 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-07 13:49:43,757 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-07 13:49:43,923 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-07 13:49:44,077 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-10-07 13:49:44,230 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:44,605 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 65 [2019-10-07 13:49:44,740 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-07 13:49:44,857 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-07 13:49:45,143 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-10-07 13:49:45,442 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 72 [2019-10-07 13:49:45,674 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 49 [2019-10-07 13:49:45,795 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-07 13:49:45,951 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:46,103 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-10-07 13:49:46,261 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-10-07 13:49:46,404 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:46,528 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-10-07 13:49:46,726 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-10-07 13:49:47,248 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-10-07 13:49:47,460 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-10-07 13:49:47,592 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:49:48,006 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 93 [2019-10-07 13:49:48,153 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:48,837 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 86 [2019-10-07 13:49:49,155 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2019-10-07 13:49:49,346 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-10-07 13:49:49,497 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:49,882 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 87 [2019-10-07 13:49:50,035 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 1 [2019-10-07 13:49:50,522 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 83 [2019-10-07 13:49:50,729 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 13:49:50,867 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-10-07 13:49:51,066 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-10-07 13:49:51,212 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:51,532 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-10-07 13:49:51,902 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 72 [2019-10-07 13:49:52,102 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-07 13:49:52,323 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-10-07 13:49:52,630 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-10-07 13:49:52,844 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 13:49:53,163 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-07 13:49:53,316 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-10-07 13:49:53,815 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-10-07 13:49:53,936 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-07 13:49:54,084 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:54,235 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:54,512 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 77 [2019-10-07 13:49:54,632 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-07 13:49:54,855 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-07 13:49:55,006 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-07 13:49:55,159 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-07 13:49:55,552 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2019-10-07 13:49:55,665 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-07 13:49:55,876 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 13:49:56,289 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-10-07 13:49:56,437 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-07 13:49:56,572 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-07 13:49:56,575 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2019-10-07 13:49:56,576 INFO L439 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 0 ~pended~0))) (.cse2 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse5 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse9 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse7 (not (= |old(~customIrp~0)| 0)))) (let ((.cse8 (not (<= ~NP~0 1))) (.cse10 (not (<= 1 |old(~s~0)|))) (.cse11 (or .cse0 (or .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse1 .cse4 .cse2 .cse5 .cse6 .cse9 .cse7))) (and (or (or (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6 .cse7) (not (<= 1 ~NP~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (<= |old(~s~0)| 1)) .cse8 .cse9 .cse10) (= ~myStatus~0 259)) (or .cse8 .cse10 .cse11) (or (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) .cse11)))) [2019-10-07 13:49:56,576 INFO L443 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2019-10-07 13:49:56,577 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2019-10-07 13:49:56,577 INFO L443 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2019-10-07 13:49:56,577 INFO L439 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 0 ~pended~0))) (.cse2 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse5 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse7 (not (= |old(~customIrp~0)| 0)))) (and (or (or (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6 .cse7) (not (<= 1 ~NP~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (<= |old(~s~0)| 1)) (not (<= ~NP~0 1)) .cse8 (not (<= 1 |old(~s~0)|))) (= ~myStatus~0 259) (and (<= 1 ~s~0) (<= ~s~0 1) .cse9)) (or (and (= ~s~0 |old(~s~0)|) .cse9) (or .cse0 (or .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse1 .cse4 .cse2 .cse5 .cse6 .cse8 .cse7)))) [2019-10-07 13:49:56,577 INFO L443 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2019-10-07 13:49:56,577 INFO L443 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2019-10-07 13:49:56,578 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~myStatus~0 259) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 ~myStatus~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,578 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2019-10-07 13:49:56,578 INFO L443 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2019-10-07 13:49:56,578 INFO L439 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,578 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2019-10-07 13:49:56,578 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L439 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2019-10-07 13:49:56,579 INFO L439 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,580 INFO L439 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,580 INFO L443 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2019-10-07 13:49:56,580 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-07 13:49:56,580 INFO L439 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,580 INFO L439 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,581 INFO L439 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse8 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or (= ~s~0 |old(~s~0)|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (or (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 (not (<= (+ ~MPR3~0 1) ~IPC~0)) .cse5 .cse7 .cse8 (not (= ~customIrp~0 0))) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (= ~myStatus~0 |old(~myStatus~0)|)))) [2019-10-07 13:49:56,581 INFO L443 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2019-10-07 13:49:56,581 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (= ~s~0 |old(~s~0)|) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-07 13:49:56,581 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-07 13:49:56,581 INFO L439 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= 0 (+ ~myStatus~0 1073741637)) (not (= 259 ~myStatus~0)) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,582 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2019-10-07 13:49:56,582 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2019-10-07 13:49:56,582 INFO L439 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (and (= 0 ~pended~0) .cse13)) (.cse0 (= ~s~0 ~IPC~0)) (.cse2 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= 1 ~NP~0)) (.cse4 (= main_~status~9 ~lowerDriverReturn~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~NP~0 1)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not (= main_~status~9 259)) (and .cse2 .cse5 .cse9 .cse1 .cse6 (= ~s~0 ~DC~0) .cse8)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse4 (= ~s~0 ~SKIP2~0) .cse9 .cse1 .cse6 .cse8) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ~compRegistered~0) .cse8 .cse13 .cse9 .cse10 .cse11 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,582 INFO L439 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (not (= 259 ~myStatus~0)) (<= 0 ~myStatus~0) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,582 INFO L443 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2019-10-07 13:49:56,583 INFO L443 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2019-10-07 13:49:56,583 INFO L439 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,583 INFO L439 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (and (= 0 ~pended~0) .cse13)) (.cse0 (= ~s~0 ~IPC~0)) (.cse2 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= 1 ~NP~0)) (.cse4 (= main_~status~9 ~lowerDriverReturn~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~NP~0 1)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not (= main_~status~9 259)) (and .cse2 .cse5 .cse9 .cse1 .cse6 (= ~s~0 ~DC~0) .cse8)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse4 (= ~s~0 ~SKIP2~0) .cse9 .cse1 .cse6 .cse8) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ~compRegistered~0) .cse8 .cse13 .cse9 .cse10 .cse11 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,583 INFO L443 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2019-10-07 13:49:56,583 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2019-10-07 13:49:56,583 INFO L443 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2019-10-07 13:49:56,584 INFO L439 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= main_~status~9 ~lowerDriverReturn~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (and (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (or (and (<= ~IPC~0 ~s~0) (and (<= 1 ~NP~0) .cse0 .cse1 .cse2 .cse3 (<= ~NP~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~MPR3~0 1) ~IPC~0))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (and .cse1 .cse2 .cse3 (= ~s~0 ~DC~0)) (not (= main_~status~9 259))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:49:56,584 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,584 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2019-10-07 13:49:56,584 INFO L439 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= 0 (+ ~myStatus~0 1073741637)) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,585 INFO L439 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse2 (= main_~status~9 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and (= ~s~0 ~IPC~0) .cse0 .cse1 (<= 1 ~NP~0) .cse2 .cse3 .cse4 (= 0 ~routine~0) .cse5 .cse6 (<= ~NP~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (and .cse1 .cse2 (= ~s~0 ~SKIP2~0) .cse6 .cse4 .cse0 .cse5) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= main_~status~9 259)) (and .cse1 .cse3 .cse6 .cse4 (= ~s~0 ~DC~0) .cse0 .cse5)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:49:56,585 INFO L443 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2019-10-07 13:49:56,585 INFO L439 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (and (= 0 ~pended~0) .cse13)) (.cse0 (= ~s~0 ~IPC~0)) (.cse2 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= 1 ~NP~0)) (.cse4 (= main_~status~9 ~lowerDriverReturn~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= ~NP~0 1)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not (= main_~status~9 259)) (and .cse2 .cse5 .cse9 .cse1 .cse6 (= ~s~0 ~DC~0) .cse8)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse4 (= ~s~0 ~SKIP2~0) .cse9 .cse1 .cse6 .cse8) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ~compRegistered~0) .cse8 .cse13 .cse9 .cse10 .cse11 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,585 INFO L439 ceAbstractionStarter]: At program point L1790(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,585 INFO L443 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2019-10-07 13:49:56,586 INFO L443 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2019-10-07 13:49:56,586 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= 0 (+ ~myStatus~0 1073741637)) (not (= 259 ~myStatus~0)) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,586 INFO L443 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2019-10-07 13:49:56,586 INFO L439 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,586 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L439 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L443 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2019-10-07 13:49:56,587 INFO L439 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (<= 0 |old(~myStatus~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,588 INFO L439 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (or (not (<= 1 ~setEventCalled~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (= ~customIrp~0 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) (= ~myStatus~0 259)) [2019-10-07 13:49:56,588 INFO L443 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2019-10-07 13:49:56,588 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (or (not (<= 1 ~setEventCalled~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (= ~customIrp~0 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) (= ~s~0 ~NP~0) (= ~myStatus~0 259)) [2019-10-07 13:49:56,588 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2019-10-07 13:49:56,588 INFO L439 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,589 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2019-10-07 13:49:56,589 INFO L439 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,589 INFO L443 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2019-10-07 13:49:56,589 INFO L443 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2019-10-07 13:49:56,589 INFO L439 ceAbstractionStarter]: At program point L2051-1(lines 2051 2071) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~s~0)| ~SKIP1~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0))) [2019-10-07 13:49:56,589 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~s~0)| ~SKIP1~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0))) [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L439 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~s~0)| ~SKIP1~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0))) [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2019-10-07 13:49:56,590 INFO L443 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2019-10-07 13:49:56,591 INFO L439 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,591 INFO L439 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,591 INFO L443 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2019-10-07 13:49:56,591 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,591 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-10-07 13:49:56,591 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L439 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-10-07 13:49:56,592 INFO L443 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2019-10-07 13:49:56,593 INFO L439 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse8 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 0 ~pended~0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or (not (<= 1 ~NP~0)) (and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 (or (or .cse2 .cse3 (or .cse4 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6) .cse7) (= ~myStatus~0 259) (not (<= 1 |old(~setEventCalled~0)|)) .cse8 .cse9 (and .cse10 (not (= |old(~s~0)| ~MPR3~0))) .cse11 .cse12 (not (<= |old(~setEventCalled~0)| 1))) (or .cse8 (and .cse0 (= ~s~0 ~NP~0)) .cse1 (not (<= 1 |old(~s~0)|)) (or .cse2 (or .cse4 .cse10 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse5 .cse9 .cse6 .cse7 .cse11 .cse12)))) [2019-10-07 13:49:56,593 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2019-10-07 13:49:56,593 INFO L443 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2019-10-07 13:49:56,593 INFO L439 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (= 0 ~pended~0))) (.cse8 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse0 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse7 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (<= ~NP~0 1))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (not (<= 1 |old(~s~0)|)) (or .cse2 (or .cse3 .cse4 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or (or (or .cse2 .cse5 (or .cse3 .cse6 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse8) .cse9) (= ~myStatus~0 259) (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse7 (and .cse4 (not (= |old(~s~0)| ~MPR3~0))) .cse1 .cse10 .cse11 (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-07 13:49:56,593 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2019-10-07 13:49:56,594 INFO L439 ceAbstractionStarter]: At program point L2018-1(lines 2005 2024) the Hoare annotation is: (let ((.cse8 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 0 ~pended~0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or (and (<= 1 ~s~0) (<= ~s~0 1) .cse0) (not (<= 1 ~NP~0)) .cse1 (or (or .cse2 .cse3 (or .cse4 .cse5 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse6) .cse7) (= ~myStatus~0 259) (not (<= 1 |old(~setEventCalled~0)|)) .cse8 .cse9 (and .cse10 (not (= |old(~s~0)| ~MPR3~0))) .cse11 .cse12 (not (<= |old(~setEventCalled~0)| 1))) (or .cse8 (and .cse0 (= ~s~0 ~NP~0)) .cse1 (not (<= 1 |old(~s~0)|)) (or .cse2 (or .cse4 .cse10 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse5 .cse9 .cse6 .cse7 .cse11 .cse12)))) [2019-10-07 13:49:56,594 INFO L443 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2019-10-07 13:49:56,594 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse2 (not (<= ~NP~0 1))) (.cse3 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (not (= 0 ~pended~0))) (.cse9 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or (and (<= 1 ~s~0) (<= ~s~0 1) .cse0) .cse1 .cse2 (not (<= 1 |old(~s~0)|)) (or .cse3 (or .cse4 .cse5 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (or (not (<= 1 ~NP~0)) .cse2 (or (or .cse3 .cse6 (or .cse4 .cse7 (not (<= 1 ~compRegistered~0)) (not (= 1 ~routine~0))) .cse9) .cse10) (and (= ~s~0 |old(~s~0)|) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= ~myStatus~0 259) (not (<= 1 |old(~setEventCalled~0)|)) .cse1 .cse8 (and .cse5 (not (= |old(~s~0)| ~MPR3~0))) .cse11 .cse12 (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-07 13:49:56,595 INFO L439 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,595 INFO L443 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2019-10-07 13:49:56,595 INFO L439 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,595 INFO L443 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-10-07 13:49:56,595 INFO L439 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,595 INFO L439 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L439 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2019-10-07 13:49:56,596 INFO L443 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2019-10-07 13:49:56,597 INFO L443 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2019-10-07 13:49:56,597 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or (= ~s~0 |old(~s~0)|) .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (or (and (<= 1 ~s~0) (<= ~s~0 1)) (or (or .cse1 .cse0 .cse2 .cse3 (not (<= (+ ~MPR3~0 1) ~IPC~0)) .cse4 (not (<= 1 ~compRegistered~0)) .cse5 (not (= 1 ~routine~0)) (not (= ~customIrp~0 0))) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~NP~0 1)) .cse6 (not (<= 1 |old(~s~0)|)))))) [2019-10-07 13:49:56,597 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2019-10-07 13:49:56,597 INFO L439 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 (not (<= (+ ~MPR3~0 1) ~IPC~0)) .cse4 (not (<= 1 ~compRegistered~0)) .cse5 (not (= 1 ~routine~0)) (not (= ~customIrp~0 0))) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (not (<= ~NP~0 1)) .cse6 (not (<= 1 |old(~s~0)|))) (or .cse1 .cse0 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) [2019-10-07 13:49:56,597 INFO L439 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,598 INFO L443 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2019-10-07 13:49:56,598 INFO L439 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,598 INFO L439 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-10-07 13:49:56,598 INFO L443 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2019-10-07 13:49:56,598 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2019-10-07 13:49:56,598 INFO L443 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2019-10-07 13:49:56,598 INFO L439 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 0 ~pended~0) (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0)) (not (<= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 ~s~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,599 INFO L443 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2019-10-07 13:49:56,599 INFO L439 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0)) (not (<= ~s~0 ~NP~0)) (<= 0 ~myStatus~0) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 ~s~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,599 INFO L443 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2019-10-07 13:49:56,599 INFO L439 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= 1 ~compRegistered~0)) (not (<= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 ~s~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:49:56,599 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2019-10-07 13:49:56,599 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2019-10-07 13:49:56,599 INFO L443 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2019-10-07 13:49:56,600 INFO L446 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2019-10-07 13:49:56,600 INFO L443 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2019-10-07 13:49:56,600 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2019-10-07 13:49:56,600 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2019-10-07 13:49:56,600 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2019-10-07 13:49:56,600 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= ~myStatus~0 259) (not (<= 0 (+ ~myStatus~0 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,600 INFO L446 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2019-10-07 13:49:56,600 INFO L446 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2019-10-07 13:49:56,601 INFO L443 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2019-10-07 13:49:56,601 INFO L443 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2019-10-07 13:49:56,601 INFO L439 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,601 INFO L443 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2019-10-07 13:49:56,601 INFO L439 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (= CdAudioPnp_~status~2 |old(~myStatus~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,601 INFO L443 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2019-10-07 13:49:56,601 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2019-10-07 13:49:56,602 INFO L443 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2019-10-07 13:49:56,602 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2019-10-07 13:49:56,602 INFO L439 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,602 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2019-10-07 13:49:56,602 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2019-10-07 13:49:56,602 INFO L439 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,603 INFO L439 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,603 INFO L439 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,603 INFO L443 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2019-10-07 13:49:56,603 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2019-10-07 13:49:56,603 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-07 13:49:56,603 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-07 13:49:56,604 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (not (= CdAudioPnp_~status~2 259)) (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,604 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-10-07 13:49:56,604 INFO L439 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (not (= CdAudioPnp_~status~2 259)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,604 INFO L439 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,604 INFO L439 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= CdAudioPnp_~status~2 |old(~myStatus~0)|) (and (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,604 INFO L443 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2019-10-07 13:49:56,605 INFO L443 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2019-10-07 13:49:56,605 INFO L439 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= |old(~myStatus~0)| 259) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,605 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2019-10-07 13:49:56,605 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2019-10-07 13:49:56,605 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2019-10-07 13:49:56,605 INFO L439 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,606 INFO L443 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2019-10-07 13:49:56,606 INFO L439 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (and (= 0 ~pended~0) (= |old(~customIrp~0)| ~customIrp~0)) (<= ~s~0 1) (<= 1 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,606 INFO L443 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2019-10-07 13:49:56,606 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2019-10-07 13:49:56,606 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2019-10-07 13:49:56,606 INFO L443 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2019-10-07 13:49:56,606 INFO L439 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,607 INFO L439 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,607 INFO L443 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2019-10-07 13:49:56,607 INFO L443 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2019-10-07 13:49:56,607 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2019-10-07 13:49:56,607 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2019-10-07 13:49:56,607 INFO L439 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,608 INFO L439 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (let ((.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~routine~0))) (let ((.cse2 (and .cse3 (and .cse0 (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse1 .cse4)))) (or (not .cse0) (not .cse1) (and (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (not .cse3) (not (<= ~NP~0 1)) (not .cse4) (and .cse2 (<= (+ CdAudio535DeviceControl_~status~5 1073741789) 0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,608 INFO L439 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,608 INFO L443 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2019-10-07 13:49:56,608 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2019-10-07 13:49:56,608 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2019-10-07 13:49:56,608 INFO L439 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,608 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2019-10-07 13:49:56,609 INFO L439 ceAbstractionStarter]: At program point L569(lines 569 864) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,609 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2019-10-07 13:49:56,609 INFO L439 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,609 INFO L443 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2019-10-07 13:49:56,609 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2019-10-07 13:49:56,609 INFO L439 ceAbstractionStarter]: At program point L587(lines 587 860) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,610 INFO L439 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,610 INFO L439 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,610 INFO L443 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2019-10-07 13:49:56,610 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2019-10-07 13:49:56,610 INFO L439 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,611 INFO L439 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,611 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2019-10-07 13:49:56,611 INFO L443 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2019-10-07 13:49:56,611 INFO L439 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,611 INFO L443 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2019-10-07 13:49:56,611 INFO L443 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2019-10-07 13:49:56,611 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2019-10-07 13:49:56,612 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-10-07 13:49:56,612 INFO L439 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,612 INFO L443 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2019-10-07 13:49:56,612 INFO L439 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,612 INFO L443 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2019-10-07 13:49:56,612 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2019-10-07 13:49:56,612 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2019-10-07 13:49:56,613 INFO L439 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,613 INFO L443 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2019-10-07 13:49:56,613 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2019-10-07 13:49:56,613 INFO L439 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,613 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2019-10-07 13:49:56,613 INFO L439 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,613 INFO L443 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2019-10-07 13:49:56,614 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2019-10-07 13:49:56,614 INFO L439 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,614 INFO L443 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2019-10-07 13:49:56,614 INFO L439 ceAbstractionStarter]: At program point L578(lines 578 862) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,614 INFO L443 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2019-10-07 13:49:56,614 INFO L439 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,615 INFO L443 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2019-10-07 13:49:56,615 INFO L443 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2019-10-07 13:49:56,615 INFO L443 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2019-10-07 13:49:56,615 INFO L443 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2019-10-07 13:49:56,615 INFO L439 ceAbstractionStarter]: At program point L596(lines 596 858) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,615 INFO L443 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2019-10-07 13:49:56,616 INFO L439 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~compRegistered~0))) (.cse13 (not (<= 1 |old(~s~0)|))) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= 1 ~NP~0))) (.cse15 (= 0 ~pended~0)) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (<= ~NP~0 1))) (.cse17 (not (= 0 ~routine~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse4 (not (= 0 |old(~pended~0)|))) (.cse0 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse8 (not (= ~customIrp~0 0)))) (and (or (= ~myStatus~0 259) (or (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~routine~0))) .cse8) .cse9 .cse10 (not (<= |old(~s~0)| 1)) .cse11 .cse12 .cse13) (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse14 0) .cse15 (<= 0 .cse14) (<= 1 ~setEventCalled~0) (<= 0 .cse16) (<= .cse16 0) (<= ~setEventCalled~0 1)))) (or .cse2 .cse5 (and (<= 1 ~s~0) (<= ~s~0 1)) .cse1 .cse11 .cse17 .cse3 .cse10 .cse4 .cse0 .cse6 .cse7 (not (<= |old(~s~0)| ~NP~0)) .cse12 .cse13 .cse8) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse2 .cse9 (and .cse15 (= ~SKIP1~0 ~s~0)) .cse1 .cse11 (not (<= |old(~s~0)| ~SKIP1~0)) .cse17 .cse3 .cse10 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse4 .cse0 .cse6 .cse12 .cse8))) [2019-10-07 13:49:56,616 INFO L443 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2019-10-07 13:49:56,616 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2019-10-07 13:49:56,616 INFO L443 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2019-10-07 13:49:56,616 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2019-10-07 13:49:56,617 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse15 (= 0 ~pended~0))) (let ((.cse10 (not (<= 1 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse0 (and .cse15 (<= 1 ~s~0) (<= ~s~0 1))) (.cse6 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse12 (not (<= ~NP~0 1))) (.cse16 (not (= 0 ~routine~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse11 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse1 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse7 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse8 (not (<= 1 ~compRegistered~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (<= 1 |old(~s~0)|))) (.cse9 (not (= ~customIrp~0 0)))) (and (or .cse0 (= ~myStatus~0 259) (or (or .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 1 ~routine~0))) .cse9) .cse10 .cse11 (not (<= |old(~s~0)| 1)) .cse12 .cse13 .cse14)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse3 .cse10 (and .cse15 (= ~SKIP1~0 ~s~0)) .cse2 .cse12 (not (<= |old(~s~0)| ~SKIP1~0)) .cse16 .cse4 .cse11 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse5 .cse1 .cse7 .cse13 .cse9) (or .cse3 .cse0 .cse6 .cse2 .cse12 .cse16 .cse4 .cse11 .cse5 .cse1 .cse7 .cse8 (not (<= |old(~s~0)| ~NP~0)) .cse13 .cse14 .cse9)))) [2019-10-07 13:49:56,617 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2019-10-07 13:49:56,617 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2019-10-07 13:49:56,617 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2019-10-07 13:49:56,617 INFO L439 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse1 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse10 (not (<= 1 ~compRegistered~0))) (.cse12 (not (<= 1 |old(~s~0)|))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse14 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (<= ~NP~0 1))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse9 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~s~0)| ~NP~0)) .cse11 .cse12 .cse13) (or (= ~myStatus~0 259) (or (or .cse8 .cse2 (or .cse0 .cse5 .cse7 .cse1 .cse9 .cse10 (not (= 1 ~routine~0))) .cse13) .cse14 .cse6 (not (<= |old(~s~0)| 1)) .cse3 .cse11 .cse12)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse14 .cse2 .cse3 (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse5 .cse6 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse7 .cse8 .cse9 .cse11 .cse13))) [2019-10-07 13:49:56,617 INFO L443 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2019-10-07 13:49:56,618 INFO L439 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~compRegistered~0))) (.cse13 (not (<= 1 |old(~s~0)|))) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= 1 ~NP~0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (<= ~NP~0 1))) (.cse14 (not (= 0 ~routine~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse4 (not (= 0 |old(~pended~0)|))) (.cse0 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse8 (not (= ~customIrp~0 0)))) (and (or (= ~myStatus~0 259) (or (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~routine~0))) .cse8) .cse9 .cse10 (not (<= |old(~s~0)| 1)) .cse11 .cse12 .cse13)) (or .cse2 (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) .cse5 .cse1 .cse11 .cse14 .cse3 .cse10 .cse4 .cse0 .cse6 .cse7 (not (<= |old(~s~0)| ~NP~0)) .cse12 .cse13 .cse8) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse2 .cse9 .cse1 .cse11 (not (<= |old(~s~0)| ~SKIP1~0)) .cse14 .cse3 .cse10 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse4 .cse0 .cse6 .cse12 .cse8))) [2019-10-07 13:49:56,618 INFO L443 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2019-10-07 13:49:56,619 INFO L439 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse7 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse9 (not (<= 1 ~compRegistered~0))) (.cse15 (not (<= 1 |old(~s~0)|))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (<= 1 ~NP~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= ~NP~0 1))) (.cse16 (not (= 0 ~routine~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse12 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse2 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse8 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse14 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse10 (not (= ~customIrp~0 0)))) (and (or (let ((.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse0 0) (= 0 ~pended~0) (<= 0 .cse0) (<= 1 ~setEventCalled~0) (<= 0 .cse1) (= ~s~0 ~NP~0) (<= .cse1 0) (<= ~setEventCalled~0 1))) (= ~myStatus~0 259) (or (or .cse2 .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 1 ~routine~0))) .cse10) .cse11 .cse12 (not (<= |old(~s~0)| 1)) .cse13 .cse14 .cse15)) (or .cse4 .cse7 .cse3 .cse13 .cse16 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 (not (<= |old(~s~0)| ~NP~0)) .cse14 .cse15 .cse10) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse4 .cse11 .cse3 .cse13 (not (<= |old(~s~0)| ~SKIP1~0)) .cse16 .cse5 .cse12 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse6 .cse2 .cse8 .cse14 .cse10))) [2019-10-07 13:49:56,619 INFO L439 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse1 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse10 (not (<= 1 ~compRegistered~0))) (.cse12 (not (<= 1 |old(~s~0)|))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse14 (not (<= 1 ~NP~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (<= ~NP~0 1))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse9 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~s~0)| ~NP~0)) .cse11 .cse12 .cse13) (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (= ~myStatus~0 259) (or (or .cse8 .cse2 (or .cse0 .cse5 .cse7 .cse1 .cse9 .cse10 (not (= 1 ~routine~0))) .cse13) .cse14 .cse6 (not (<= |old(~s~0)| 1)) .cse3 .cse11 .cse12)) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse0 .cse14 .cse2 .cse3 (not (<= |old(~s~0)| ~SKIP1~0)) .cse4 .cse5 .cse6 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse7 .cse8 .cse9 .cse11 .cse13))) [2019-10-07 13:49:56,619 INFO L443 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2019-10-07 13:49:56,619 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2019-10-07 13:49:56,620 INFO L439 ceAbstractionStarter]: At program point L1901-1(lines 1900 1976) the Hoare annotation is: (let ((.cse5 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~compRegistered~0))) (.cse13 (not (<= 1 |old(~s~0)|))) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= 1 ~NP~0))) (.cse15 (= 0 ~pended~0)) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (<= ~NP~0 1))) (.cse17 (not (= 0 ~routine~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 0 (+ ~myStatus~0 1073741637)))) (.cse4 (not (= 0 |old(~pended~0)|))) (.cse0 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0)))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse8 (not (= ~customIrp~0 0)))) (and (or (= ~myStatus~0 259) (or (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~routine~0))) .cse8) .cse9 .cse10 (not (<= |old(~s~0)| 1)) .cse11 .cse12 .cse13) (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse14 0) .cse15 (<= 0 .cse14) (<= 1 ~setEventCalled~0) (<= 0 .cse16) (<= .cse16 0) (<= ~setEventCalled~0 1)))) (or .cse2 .cse5 (and (<= 1 ~s~0) (<= ~s~0 1)) .cse1 .cse11 .cse17 .cse3 .cse10 .cse4 .cse0 .cse6 .cse7 (not (<= |old(~s~0)| ~NP~0)) .cse12 .cse13 .cse8) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) .cse2 .cse9 (and .cse15 (= ~SKIP1~0 ~s~0)) .cse1 .cse11 (not (<= |old(~s~0)| ~SKIP1~0)) .cse17 .cse3 .cse10 (not (<= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse4 .cse0 .cse6 .cse12 .cse8))) [2019-10-07 13:49:56,620 INFO L439 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-07 13:49:56,620 INFO L439 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-07 13:49:56,620 INFO L443 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2019-10-07 13:49:56,620 INFO L439 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2019-10-07 13:49:56,620 INFO L443 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2019-10-07 13:49:56,620 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2019-10-07 13:49:56,621 INFO L443 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2019-10-07 13:49:56,621 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2019-10-07 13:49:56,621 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:49:56,621 INFO L439 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (and (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,621 INFO L443 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2019-10-07 13:49:56,621 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2019-10-07 13:49:56,622 INFO L439 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,622 INFO L443 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2019-10-07 13:49:56,622 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2019-10-07 13:49:56,622 INFO L443 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2019-10-07 13:49:56,622 INFO L439 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,622 INFO L439 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,622 INFO L443 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2019-10-07 13:49:56,623 INFO L439 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,623 INFO L443 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2019-10-07 13:49:56,623 INFO L443 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2019-10-07 13:49:56,623 INFO L439 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,623 INFO L439 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,623 INFO L443 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2019-10-07 13:49:56,623 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2019-10-07 13:49:56,624 INFO L443 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2019-10-07 13:49:56,624 INFO L443 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2019-10-07 13:49:56,624 INFO L439 ceAbstractionStarter]: At program point L325(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,624 INFO L439 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (and (= 0 ~pended~0) .cse1)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse5 (= 0 ~routine~0))) (let ((.cse2 (and .cse4 .cse0 .cse5)) (.cse3 (= ~s~0 ~IPC~0)) (.cse6 (= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0))) (or (not .cse0) (not .cse1) (and (not (= CdAudioDeviceControl_~status~3 259)) (and .cse2 (= ~s~0 ~DC~0))) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse6 (= ~s~0 ~SKIP2~0) .cse2) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and .cse3 .cse5 (<= 1 ~compRegistered~0) .cse6 .cse7) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))))) [2019-10-07 13:49:56,624 INFO L439 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,624 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2019-10-07 13:49:56,625 INFO L439 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,625 INFO L443 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2019-10-07 13:49:56,625 INFO L443 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2019-10-07 13:49:56,625 INFO L439 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,625 INFO L443 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2019-10-07 13:49:56,626 INFO L439 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,626 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2019-10-07 13:49:56,626 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:49:56,626 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= 0 ~customIrp~0) (not (= 259 ~myStatus~0)) (<= 0 ~myStatus~0) (= ~s~0 ~SKIP2~0) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:49:56,626 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:49:56,626 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:49:56,626 INFO L439 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,626 INFO L443 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2019-10-07 13:49:56,627 INFO L439 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 259 CdAudio435DeviceControl_~status~6)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,627 INFO L443 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2019-10-07 13:49:56,627 INFO L439 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (not (= 259 CdAudio435DeviceControl_~status~6)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,627 INFO L443 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2019-10-07 13:49:56,627 INFO L439 ceAbstractionStarter]: At program point L1077(lines 1077 1470) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,627 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2019-10-07 13:49:56,628 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2019-10-07 13:49:56,628 INFO L439 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (not (= 259 CdAudio435DeviceControl_~status~6)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,628 INFO L443 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2019-10-07 13:49:56,628 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2019-10-07 13:49:56,628 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2019-10-07 13:49:56,628 INFO L439 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (not (= 259 CdAudio435DeviceControl_~status~6)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,628 INFO L443 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L443 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L439 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,629 INFO L443 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L443 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L443 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2019-10-07 13:49:56,629 INFO L439 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse3 (and .cse2 (and .cse0 (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse1 (= 0 ~compRegistered~0) .cse4 .cse5)))) (or (not .cse0) (not .cse1) (not .cse2) (not (<= ~NP~0 1)) (and .cse3 (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (not .cse4) (not .cse5) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (and (and (= |old(~customIrp~0)| ~customIrp~0) .cse3) (not (= 259 CdAudio435DeviceControl_~status~6))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,630 INFO L439 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 259 CdAudio435DeviceControl_~status~6)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,630 INFO L443 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2019-10-07 13:49:56,630 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2019-10-07 13:49:56,630 INFO L439 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,630 INFO L439 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,631 INFO L439 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse3 (and .cse2 (and .cse0 (= ~s~0 ~NP~0) (= 0 ~pended~0) .cse1 (= 0 ~compRegistered~0) .cse4 .cse5)))) (or (not .cse0) (not .cse1) (not .cse2) (not (<= ~NP~0 1)) (and .cse3 (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (not .cse4) (not .cse5) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (and (and (= |old(~customIrp~0)| ~customIrp~0) .cse3) (not (= 259 CdAudio435DeviceControl_~status~6))) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:49:56,631 INFO L443 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2019-10-07 13:49:56,631 INFO L443 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2019-10-07 13:49:56,631 INFO L439 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (not (= 259 CdAudio435DeviceControl_~status~6)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,631 INFO L439 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,631 INFO L443 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2019-10-07 13:49:56,631 INFO L443 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2019-10-07 13:49:56,632 INFO L443 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2019-10-07 13:49:56,632 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2019-10-07 13:49:56,632 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2019-10-07 13:49:56,632 INFO L439 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (<= ~s~0 1)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)) .cse2 .cse3) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) .cse2 .cse3) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:49:56,632 INFO L439 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,632 INFO L443 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2019-10-07 13:49:56,633 INFO L439 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,633 INFO L439 ceAbstractionStarter]: At program point L1050(lines 1050 1476) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,633 INFO L443 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2019-10-07 13:49:56,633 INFO L443 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2019-10-07 13:49:56,633 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2019-10-07 13:49:56,634 INFO L439 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,634 INFO L443 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2019-10-07 13:49:56,634 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2019-10-07 13:49:56,634 INFO L439 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,634 INFO L443 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2019-10-07 13:49:56,634 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2019-10-07 13:49:56,634 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2019-10-07 13:49:56,635 INFO L439 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,635 INFO L439 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,635 INFO L443 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2019-10-07 13:49:56,635 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2019-10-07 13:49:56,635 INFO L439 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,635 INFO L443 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2019-10-07 13:49:56,636 INFO L443 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2019-10-07 13:49:56,636 INFO L439 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (not (= 259 CdAudio435DeviceControl_~status~6)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= |old(~customIrp~0)| ~customIrp~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,636 INFO L443 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2019-10-07 13:49:56,636 INFO L439 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,636 INFO L443 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2019-10-07 13:49:56,636 INFO L439 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,637 INFO L443 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2019-10-07 13:49:56,637 INFO L439 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,637 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2019-10-07 13:49:56,637 INFO L443 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2019-10-07 13:49:56,637 INFO L443 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2019-10-07 13:49:56,637 INFO L439 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp103~1)) (<= (+ CdAudio435DeviceControl_~status~6 1073741686) 0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)))) (<= ~s~0 1) (<= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,637 INFO L443 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2019-10-07 13:49:56,638 INFO L439 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,638 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2019-10-07 13:49:56,638 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2019-10-07 13:49:56,638 INFO L443 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2019-10-07 13:49:56,638 INFO L439 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (<= ~s~0 1)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0))) (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0)) .cse2 .cse3) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) .cse2 .cse3) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:49:56,638 INFO L443 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2019-10-07 13:49:56,639 INFO L439 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,639 INFO L443 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2019-10-07 13:49:56,639 INFO L439 ceAbstractionStarter]: At program point L1041(lines 1041 1478) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,639 INFO L439 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 259 CdAudio435DeviceControl_~status~6)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,639 INFO L443 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2019-10-07 13:49:56,639 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2019-10-07 13:49:56,639 INFO L443 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2019-10-07 13:49:56,640 INFO L439 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,640 INFO L443 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2019-10-07 13:49:56,640 INFO L439 ceAbstractionStarter]: At program point L1059(lines 1059 1474) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 0 (+ |old(~myStatus~0)| 1073741637))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (<= 1 ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1 CdAudio435DeviceControl_~__cil_tmp42~0))) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:49:56,640 INFO L446 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2019-10-07 13:49:56,640 INFO L443 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2019-10-07 13:49:56,640 INFO L443 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2019-10-07 13:49:56,640 INFO L443 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2019-10-07 13:49:56,641 INFO L443 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2019-10-07 13:49:56,641 INFO L439 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (= ~myStatus~0 259) (or (not (<= 0 (+ ~myStatus~0 1073741637))) (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)))) [2019-10-07 13:49:56,641 INFO L443 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2019-10-07 13:49:56,641 INFO L443 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2019-10-07 13:49:56,641 INFO L443 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2019-10-07 13:49:56,641 INFO L439 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= ~routine~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 259) (or (not (<= 0 (+ ~myStatus~0 1073741637))) (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)))) [2019-10-07 13:49:56,641 INFO L443 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2019-10-07 13:49:56,642 INFO L439 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (or (= ~myStatus~0 259) (or (not (<= 0 (+ ~myStatus~0 1073741637))) (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2019-10-07 13:49:56,642 INFO L439 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (= ~myStatus~0 259) (or (not (<= 0 (+ ~myStatus~0 1073741637))) (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)))) [2019-10-07 13:49:56,642 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2019-10-07 13:49:56,642 INFO L439 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (or (= ~myStatus~0 259) (and (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (or (= ~s~0 ~NP~0) (= ~MPR3~0 ~s~0)) (= 259 CdAudioForwardIrpSynchronous_~status~8) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (or (not (<= 0 (+ ~myStatus~0 1073741637))) (or (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 |old(~routine~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~SKIP1~0 ~IPC~0))) (not (<= |old(~s~0)| ~NP~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~NP~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= 1 |old(~s~0)|)))) [2019-10-07 13:49:56,642 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2019-10-07 13:49:56,642 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2019-10-07 13:49:56,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:49:56 BoogieIcfgContainer [2019-10-07 13:49:56,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:49:56,707 INFO L168 Benchmark]: Toolchain (without parser) took 70050.89 ms. Allocated memory was 145.8 MB in the beginning and 841.5 MB in the end (delta: 695.7 MB). Free memory was 100.5 MB in the beginning and 80.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 716.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,708 INFO L168 Benchmark]: CDTParser took 1.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.31 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 160.5 MB in the end (delta: -60.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,709 INFO L168 Benchmark]: Boogie Preprocessor took 112.86 ms. Allocated memory is still 203.4 MB. Free memory was 160.5 MB in the beginning and 155.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,709 INFO L168 Benchmark]: RCFGBuilder took 2192.01 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 155.1 MB in the beginning and 182.4 MB in the end (delta: -27.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,710 INFO L168 Benchmark]: TraceAbstraction took 66923.81 ms. Allocated memory was 247.5 MB in the beginning and 841.5 MB in the end (delta: 594.0 MB). Free memory was 182.4 MB in the beginning and 80.8 MB in the end (delta: 101.7 MB). Peak memory consumption was 696.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:56,712 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.31 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 160.5 MB in the end (delta: -60.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.86 ms. Allocated memory is still 203.4 MB. Free memory was 160.5 MB in the beginning and 155.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2192.01 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 155.1 MB in the beginning and 182.4 MB in the end (delta: -27.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66923.81 ms. Allocated memory was 247.5 MB in the beginning and 841.5 MB in the end (delta: 594.0 MB). Free memory was 182.4 MB in the beginning and 80.8 MB in the end (delta: 101.7 MB). Peak memory consumption was 696.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: 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: 1756]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s == IPC && 0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && 1 <= NP) && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC) || (!(status == 259) && (((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((NP + 2 <= SKIP1 && status == lowerDriverReturn) && s == SKIP2) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((((((s == IPC && NP + 2 <= SKIP1) && 1 <= NP) && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(SKIP1) == \old(s)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((DC + 2 <= SKIP2 && (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && 0 == routine) && \old(customIrp) == customIrp) && status + 1073741670 <= 0)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || ((DC + 2 <= SKIP2 && (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && 0 == routine) && status + 1073741789 <= 0)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s == IPC && 0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && 1 <= NP) && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC) || (!(status == 259) && (((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((NP + 2 <= SKIP1 && status == lowerDriverReturn) && s == SKIP2) && DC + 2 <= SKIP2) && 0 == pended && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((((((s == IPC && NP + 2 <= SKIP1) && 1 <= NP) && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((s == NP && 0 == pended) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((((0 == pended && 1 <= compRegistered) && 1 <= s) && s <= 1) && routine == 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || myStatus == 259) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || (0 == pended && s == \old(s))) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(SKIP1) == \old(s)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: (((myStatus == 259 || ((((((((!(MPR3 + 1 <= IPC) || !(DC + 2 <= SKIP2)) || (((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(\old(s) + 2 <= SKIP1)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(1 == routine)) || !(customIrp == 0)) || !(1 <= NP)) || !(0 <= myStatus + 1073741637)) || !(\old(s) <= 1)) || !(NP <= 1)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1)) && (((((((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || (1 <= s && s <= 1)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(customIrp == 0))) && ((((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || (0 == pended && SKIP1 == s)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= myStatus + 1073741637)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) || !(customIrp == 0)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((((0 == pended && 1 <= compRegistered) && 1 <= s) && s <= 1) && routine == 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || myStatus == 259) || !(0 <= myStatus + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && 0 == routine) && SKIP1 + 2 <= MPR1) && status + 1073741789 <= 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || ((\old(customIrp) == customIrp && DC + 2 <= SKIP2 && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && 0 == routine) && SKIP1 + 2 <= MPR1) && !(259 == status))) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(SKIP1) == \old(s)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= s) && 0 <= myStatus + 1073741637) && !(259 == myStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC)) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || (0 == pended && s == \old(s))) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == routine)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || \old(myStatus) == 259) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((((((((((!(1 <= NP) || ((((s == \old(s) && !(MPR3 == s)) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(NP <= 1)) || (((!(NP + 2 <= SKIP1) || !(SKIP1 + 2 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2)) || myStatus == 259) || !(1 <= \old(setEventCalled))) || !(0 <= myStatus + 1073741637)) || !(MPR3 + 1 <= IPC)) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1)) && ((((!(0 <= myStatus + 1073741637) || (\old(customIrp) == customIrp && s == NP)) || !(NP <= 1)) || !(1 <= \old(s))) || ((((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((((IPC <= s && ((((((1 <= NP && status == lowerDriverReturn) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && SKIP2 + NP + 5 <= IPC + SKIP1) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((DC + 5 <= IPC && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && SKIP2 + NP + 5 <= IPC + SKIP1) && s == DC) && !(status == 259))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((status == lowerDriverReturn && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP2 <= s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == pended && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2127]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (!(status == 259) && (((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && 0 == routine) && s == DC)) || ((((s == IPC && 0 == pended && NP + 5 <= MPR3) && 0 == routine) && status == lowerDriverReturn) && \old(customIrp) == customIrp)) || ((status == lowerDriverReturn && s == SKIP2) && ((0 == pended && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && 0 == routine)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(1 <= NP)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((((s == IPC && 0 == routine) && 1 <= compRegistered) && status == lowerDriverReturn) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || !(0 <= \old(myStatus) + 1073741637)) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((((((((((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(1 <= NP)) || !(NP <= 1)) || (((!(NP + 2 <= SKIP1) || !(SKIP1 + 2 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(1 == routine)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2)) || myStatus == 259) || !(1 <= \old(setEventCalled))) || !(0 <= myStatus + 1073741637)) || !(MPR3 + 1 <= IPC)) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1)) && ((((!(0 <= myStatus + 1073741637) || (\old(customIrp) == customIrp && s == NP)) || !(NP <= 1)) || !(1 <= \old(s))) || ((((((((!(NP + 2 <= SKIP1) || (!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 == pended)) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((((((!(status == 259) && 0 == pended) && 0 == compRegistered) && 0 == routine) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == NP)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || \old(myStatus) == 259) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((((0 == pended && 1 <= s) && !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42)) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || ((((0 == pended && 1 <= s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) && s <= 1) && \old(customIrp) == customIrp)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2051]: Loop Invariant Derived loop invariant: (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (0 == pended && SKIP1 == s) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(SKIP1) == \old(s)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= s) && 0 <= myStatus + 1073741637) && SKIP2 + NP + 5 <= IPC + SKIP1) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: (((myStatus == 259 || ((((((((!(MPR3 + 1 <= IPC) || !(DC + 2 <= SKIP2)) || (((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(0 == \old(pended))) || !(\old(s) + 2 <= SKIP1)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(1 == routine)) || !(customIrp == 0)) || !(1 <= NP)) || !(0 <= myStatus + 1073741637)) || !(\old(s) <= 1)) || !(NP <= 1)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || (((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1)) && (((((((((((((((!(NP + 5 <= MPR3) || !(\old(s) + 2 <= SKIP1)) || (1 <= s && s <= 1)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= myStatus + 1073741637)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(customIrp == 0))) && ((((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || (0 == pended && SKIP1 == s)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= myStatus + 1073741637)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(DC + 5 <= IPC)) || !(customIrp == 0)) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((((0 == pended && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || ((0 == pended && s == \old(s)) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || \old(myStatus) == 259) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || (((((0 == pended && 0 == compRegistered) && 0 == routine) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == NP)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s == IPC && NP + 5 <= MPR3) && NP + 2 <= SKIP1) && 1 <= NP) && status == lowerDriverReturn) && DC + 5 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && NP <= 1) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC) || ((((((NP + 2 <= SKIP1 && status == lowerDriverReturn) && s == SKIP2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (!(status == 259) && (((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(0 <= \old(myStatus))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || ((((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || \old(myStatus) == 259) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (((((0 == pended && 1 <= s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp42))) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == pended && 0 == compRegistered) && 0 == routine) && 1 <= s) && s <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 2 <= SKIP1)) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == \old(routine))) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || (((0 == pended && 1 <= s) && s <= 1) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(0 <= \old(myStatus) + 1073741637)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(MPR3 + 1 <= IPC)) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || !(\old(s) <= NP)) || !(DC + 5 <= IPC)) || !(1 <= \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: (((((((((!(NP + 2 <= SKIP1) || !(NP + 5 <= MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(s) <= SKIP1)) || !(0 == routine)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP1 <= \old(s))) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(SKIP2 + NP + 5 <= SKIP1 + IPC)) || (0 == pended && SKIP1 == s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 408 locations, 1 error locations. Result: SAFE, OverallTime: 66.7s, OverallIterations: 67, TraceHistogramMax: 2, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 33.7s, HoareTripleCheckerStatistics: 28716 SDtfs, 13585 SDslu, 143071 SDs, 0 SdLazy, 17101 SolverSat, 3735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 167 SyntacticMatches, 8 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 67 MinimizatonAttempts, 1582 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 164 LocationsWithAnnotation, 1297 PreInvPairs, 1477 NumberOfFragments, 17253 HoareAnnotationTreeSize, 1297 FomulaSimplifications, 1786011 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 164 FomulaSimplificationsInter, 181025 FormulaSimplificationTreeSizeReductionInter, 31.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3654 NumberOfCodeBlocks, 3654 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3587 ConstructedInterpolants, 0 QuantifiedInterpolants, 439067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 43/43 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...