./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d647228c0dc0174eb229424fd194f0e34ba347e1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:31:11,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:31:11,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:31:11,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:31:11,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:31:11,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:31:11,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:31:11,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:31:11,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:31:11,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:31:11,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:31:11,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:31:11,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:31:11,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:31:11,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:31:11,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:31:11,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:31:11,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:31:11,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:31:11,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:31:11,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:31:11,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:31:11,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:31:11,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:31:11,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:31:11,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:31:11,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:31:11,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:31:11,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:31:11,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:31:11,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:31:11,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:31:11,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:31:11,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:31:11,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:31:11,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:31:11,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 04:31:11,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:31:11,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:31:11,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:31:11,761 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:31:11,761 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:31:11,762 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:31:11,762 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:31:11,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:31:11,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:31:11,763 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:31:11,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:31:11,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:31:11,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:31:11,765 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d647228c0dc0174eb229424fd194f0e34ba347e1 [2018-11-23 04:31:11,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:31:11,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:31:11,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:31:11,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:31:11,803 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:31:11,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 04:31:11,850 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/data/74e8a08af/fd5d34f908fb4cdfba471ddef12f19e4/FLAG3f6d087ef [2018-11-23 04:31:12,244 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:31:12,244 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 04:31:12,255 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/data/74e8a08af/fd5d34f908fb4cdfba471ddef12f19e4/FLAG3f6d087ef [2018-11-23 04:31:12,263 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/data/74e8a08af/fd5d34f908fb4cdfba471ddef12f19e4 [2018-11-23 04:31:12,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:31:12,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:31:12,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:31:12,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:31:12,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:31:12,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5876d528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12, skipping insertion in model container [2018-11-23 04:31:12,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:31:12,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:31:12,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:31:12,621 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:31:12,772 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:31:12,789 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:31:12,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12 WrapperNode [2018-11-23 04:31:12,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:31:12,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:31:12,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:31:12,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:31:12,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:31:12,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:31:12,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:31:12,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:31:12,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... [2018-11-23 04:31:12,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:31:12,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:31:12,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:31:12,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:31:12,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/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 [2018-11-23 04:31:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-23 04:31:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-23 04:31:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 04:31:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 04:31:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-23 04:31:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-23 04:31:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-23 04:31:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-23 04:31:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:31:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:31:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 04:31:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 04:31:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 04:31:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 04:31:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-23 04:31:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-23 04:31:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 04:31:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 04:31:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-23 04:31:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-23 04:31:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 04:31:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 04:31:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-23 04:31:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-23 04:31:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-23 04:31:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-23 04:31:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-23 04:31:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-23 04:31:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 04:31:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 04:31:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 04:31:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 04:31:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-23 04:31:12,930 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-23 04:31:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-23 04:31:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-23 04:31:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 04:31:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 04:31:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-23 04:31:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-23 04:31:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 04:31:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 04:31:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-23 04:31:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-23 04:31:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:31:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:31:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-23 04:31:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-23 04:31:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-23 04:31:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-23 04:31:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:31:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:31:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-23 04:31:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-23 04:31:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-23 04:31:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-23 04:31:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-23 04:31:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-23 04:31:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 04:31:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 04:31:13,307 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,307 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,378 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,378 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,456 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,457 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,529 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,530 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,577 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,577 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,698 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,699 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,735 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,736 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,749 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,750 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,888 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 04:31:13,888 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 04:31:13,904 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:31:13,904 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 04:31:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:31:13 BoogieIcfgContainer [2018-11-23 04:31:13,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:31:13,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:31:13,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:31:13,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:31:13,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:31:12" (1/3) ... [2018-11-23 04:31:13,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72482078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:31:13, skipping insertion in model container [2018-11-23 04:31:13,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:31:12" (2/3) ... [2018-11-23 04:31:13,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72482078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:31:13, skipping insertion in model container [2018-11-23 04:31:13,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:31:13" (3/3) ... [2018-11-23 04:31:13,910 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 04:31:13,916 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:31:13,922 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:31:13,933 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:31:13,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:31:13,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:31:13,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:31:13,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:31:13,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:31:13,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:31:13,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:31:13,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:31:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-11-23 04:31:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 04:31:13,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:13,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:13,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:13,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:13,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-11-23 04:31:13,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:14,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:14,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:14,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:14,182 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-11-23 04:31:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:14,339 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-11-23 04:31:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:14,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 04:31:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:14,353 INFO L225 Difference]: With dead ends: 887 [2018-11-23 04:31:14,353 INFO L226 Difference]: Without dead ends: 507 [2018-11-23 04:31:14,358 INFO L631 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 [2018-11-23 04:31:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-23 04:31:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-11-23 04:31:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-23 04:31:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-11-23 04:31:14,423 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-11-23 04:31:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:14,423 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-11-23 04:31:14,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-11-23 04:31:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:31:14,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:14,425 INFO L402 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] [2018-11-23 04:31:14,425 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:14,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-11-23 04:31:14,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:14,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:14,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:14,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:14,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:14,538 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-11-23 04:31:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:14,762 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-11-23 04:31:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:14,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 04:31:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:14,767 INFO L225 Difference]: With dead ends: 789 [2018-11-23 04:31:14,767 INFO L226 Difference]: Without dead ends: 670 [2018-11-23 04:31:14,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-23 04:31:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-11-23 04:31:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-23 04:31:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-11-23 04:31:14,798 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-11-23 04:31:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:14,798 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-11-23 04:31:14,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-11-23 04:31:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:31:14,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:14,800 INFO L402 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] [2018-11-23 04:31:14,800 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:14,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-11-23 04:31:14,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:14,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:14,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:14,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:14,855 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-11-23 04:31:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:14,901 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-11-23 04:31:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:14,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 04:31:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:14,906 INFO L225 Difference]: With dead ends: 995 [2018-11-23 04:31:14,906 INFO L226 Difference]: Without dead ends: 819 [2018-11-23 04:31:14,907 INFO L631 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 [2018-11-23 04:31:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-23 04:31:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-11-23 04:31:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-11-23 04:31:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-11-23 04:31:14,937 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-11-23 04:31:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:14,937 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-11-23 04:31:14,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-11-23 04:31:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 04:31:14,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:14,939 INFO L402 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] [2018-11-23 04:31:14,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:14,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-11-23 04:31:14,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:14,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:14,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:14,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:14,979 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-11-23 04:31:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:15,144 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-11-23 04:31:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:15,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 04:31:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:15,151 INFO L225 Difference]: With dead ends: 1424 [2018-11-23 04:31:15,152 INFO L226 Difference]: Without dead ends: 1160 [2018-11-23 04:31:15,153 INFO L631 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 [2018-11-23 04:31:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-23 04:31:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-11-23 04:31:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-11-23 04:31:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-11-23 04:31:15,199 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-11-23 04:31:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:15,200 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-11-23 04:31:15,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-11-23 04:31:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 04:31:15,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:15,202 INFO L402 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] [2018-11-23 04:31:15,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:15,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-11-23 04:31:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:15,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:15,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:15,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:15,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:15,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:15,272 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-11-23 04:31:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:15,993 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-11-23 04:31:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:15,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 04:31:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:15,998 INFO L225 Difference]: With dead ends: 1562 [2018-11-23 04:31:15,998 INFO L226 Difference]: Without dead ends: 984 [2018-11-23 04:31:16,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-23 04:31:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-11-23 04:31:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-23 04:31:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-11-23 04:31:16,071 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-11-23 04:31:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:16,071 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-11-23 04:31:16,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-11-23 04:31:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:31:16,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:16,073 INFO L402 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] [2018-11-23 04:31:16,073 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:16,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-11-23 04:31:16,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:16,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:16,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:16,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:16,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:16,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:16,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,134 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-11-23 04:31:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:16,211 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-11-23 04:31:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:16,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 04:31:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:16,216 INFO L225 Difference]: With dead ends: 890 [2018-11-23 04:31:16,216 INFO L226 Difference]: Without dead ends: 886 [2018-11-23 04:31:16,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-23 04:31:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-11-23 04:31:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-23 04:31:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-11-23 04:31:16,257 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-11-23 04:31:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:16,257 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-11-23 04:31:16,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-11-23 04:31:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 04:31:16,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:16,259 INFO L402 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] [2018-11-23 04:31:16,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:16,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-11-23 04:31:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:16,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:16,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:16,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:16,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,297 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-11-23 04:31:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:16,346 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-11-23 04:31:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:16,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 04:31:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:16,351 INFO L225 Difference]: With dead ends: 1274 [2018-11-23 04:31:16,351 INFO L226 Difference]: Without dead ends: 1015 [2018-11-23 04:31:16,352 INFO L631 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 [2018-11-23 04:31:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-23 04:31:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-11-23 04:31:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 04:31:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-11-23 04:31:16,397 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-11-23 04:31:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:16,398 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-11-23 04:31:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-11-23 04:31:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 04:31:16,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:16,400 INFO L402 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] [2018-11-23 04:31:16,400 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:16,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-11-23 04:31:16,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:16,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:16,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:16,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:16,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:16,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,441 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-11-23 04:31:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:16,501 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-11-23 04:31:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:16,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 04:31:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:16,507 INFO L225 Difference]: With dead ends: 972 [2018-11-23 04:31:16,508 INFO L226 Difference]: Without dead ends: 954 [2018-11-23 04:31:16,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-11-23 04:31:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-11-23 04:31:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-23 04:31:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-11-23 04:31:16,566 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-11-23 04:31:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:16,567 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-11-23 04:31:16,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-11-23 04:31:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 04:31:16,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:16,569 INFO L402 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] [2018-11-23 04:31:16,569 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-11-23 04:31:16,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:16,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:16,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:16,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:16,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:16,637 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-11-23 04:31:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:16,693 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-11-23 04:31:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:16,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 04:31:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:16,698 INFO L225 Difference]: With dead ends: 1167 [2018-11-23 04:31:16,698 INFO L226 Difference]: Without dead ends: 925 [2018-11-23 04:31:16,699 INFO L631 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 [2018-11-23 04:31:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-23 04:31:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-11-23 04:31:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-23 04:31:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-11-23 04:31:16,752 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-11-23 04:31:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:16,752 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-11-23 04:31:16,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-11-23 04:31:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 04:31:16,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:16,756 INFO L402 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] [2018-11-23 04:31:16,756 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:16,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-11-23 04:31:16,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:16,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:16,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:16,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:16,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:31:16,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:16,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:31:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:31:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:31:16,794 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-11-23 04:31:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,212 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-11-23 04:31:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:31:17,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-23 04:31:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:17,216 INFO L225 Difference]: With dead ends: 1014 [2018-11-23 04:31:17,216 INFO L226 Difference]: Without dead ends: 785 [2018-11-23 04:31:17,217 INFO L631 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 [2018-11-23 04:31:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-23 04:31:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-11-23 04:31:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-23 04:31:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-11-23 04:31:17,267 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-11-23 04:31:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:17,267 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-11-23 04:31:17,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:31:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-11-23 04:31:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 04:31:17,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:17,269 INFO L402 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] [2018-11-23 04:31:17,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:17,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-11-23 04:31:17,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:17,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:17,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:17,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:17,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:17,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:17,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:17,319 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-11-23 04:31:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,380 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-11-23 04:31:17,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:17,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-23 04:31:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:17,383 INFO L225 Difference]: With dead ends: 871 [2018-11-23 04:31:17,383 INFO L226 Difference]: Without dead ends: 775 [2018-11-23 04:31:17,384 INFO L631 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 [2018-11-23 04:31:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-11-23 04:31:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-11-23 04:31:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-23 04:31:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-11-23 04:31:17,407 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-11-23 04:31:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:17,407 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-11-23 04:31:17,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-11-23 04:31:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 04:31:17,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:17,409 INFO L402 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] [2018-11-23 04:31:17,409 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:17,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-11-23 04:31:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:17,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:17,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:17,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:17,436 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-11-23 04:31:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,515 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-11-23 04:31:17,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:17,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 04:31:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:17,518 INFO L225 Difference]: With dead ends: 938 [2018-11-23 04:31:17,518 INFO L226 Difference]: Without dead ends: 928 [2018-11-23 04:31:17,518 INFO L631 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 [2018-11-23 04:31:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-11-23 04:31:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-11-23 04:31:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-11-23 04:31:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-11-23 04:31:17,545 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-11-23 04:31:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:17,546 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-11-23 04:31:17,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-11-23 04:31:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 04:31:17,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:17,547 INFO L402 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] [2018-11-23 04:31:17,548 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-11-23 04:31:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:17,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:17,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 04:31:17,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:17,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:31:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:31:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:17,595 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-11-23 04:31:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,691 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-11-23 04:31:17,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:31:17,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 04:31:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:17,694 INFO L225 Difference]: With dead ends: 851 [2018-11-23 04:31:17,695 INFO L226 Difference]: Without dead ends: 847 [2018-11-23 04:31:17,695 INFO L631 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 [2018-11-23 04:31:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-11-23 04:31:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-11-23 04:31:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-23 04:31:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-11-23 04:31:17,724 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-11-23 04:31:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:17,725 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-11-23 04:31:17,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:31:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-11-23 04:31:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 04:31:17,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:17,728 INFO L402 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] [2018-11-23 04:31:17,728 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:17,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-11-23 04:31:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:17,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:17,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 04:31:17,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:17,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:31:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:31:17,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:17,781 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-11-23 04:31:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,850 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-11-23 04:31:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:31:17,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 04:31:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:17,852 INFO L225 Difference]: With dead ends: 886 [2018-11-23 04:31:17,853 INFO L226 Difference]: Without dead ends: 865 [2018-11-23 04:31:17,853 INFO L631 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 [2018-11-23 04:31:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-23 04:31:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-11-23 04:31:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-23 04:31:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-11-23 04:31:17,883 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-11-23 04:31:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:17,883 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-11-23 04:31:17,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:31:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-11-23 04:31:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:31:17,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:17,885 INFO L402 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] [2018-11-23 04:31:17,885 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:17,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-11-23 04:31:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:17,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:17,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:17,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:17,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:17,927 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-11-23 04:31:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:17,998 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-11-23 04:31:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:17,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 04:31:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:18,001 INFO L225 Difference]: With dead ends: 1081 [2018-11-23 04:31:18,002 INFO L226 Difference]: Without dead ends: 1049 [2018-11-23 04:31:18,002 INFO L631 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 [2018-11-23 04:31:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-23 04:31:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-11-23 04:31:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-23 04:31:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-11-23 04:31:18,037 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-11-23 04:31:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:18,037 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-11-23 04:31:18,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-11-23 04:31:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:31:18,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:18,039 INFO L402 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] [2018-11-23 04:31:18,039 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:18,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-11-23 04:31:18,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:18,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:31:18,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:18,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:31:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:31:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:31:18,065 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-11-23 04:31:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:18,110 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-11-23 04:31:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:31:18,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-23 04:31:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:18,113 INFO L225 Difference]: With dead ends: 966 [2018-11-23 04:31:18,113 INFO L226 Difference]: Without dead ends: 944 [2018-11-23 04:31:18,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-11-23 04:31:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-11-23 04:31:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-23 04:31:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-11-23 04:31:18,168 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-11-23 04:31:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-11-23 04:31:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:31:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-11-23 04:31:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:31:18,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:18,171 INFO L402 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] [2018-11-23 04:31:18,171 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:18,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-11-23 04:31:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:18,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:18,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:18,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:31:18,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:31:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:31:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:18,234 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-11-23 04:31:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:18,880 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-11-23 04:31:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:31:18,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-23 04:31:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:18,883 INFO L225 Difference]: With dead ends: 1110 [2018-11-23 04:31:18,883 INFO L226 Difference]: Without dead ends: 1016 [2018-11-23 04:31:18,884 INFO L631 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 [2018-11-23 04:31:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-11-23 04:31:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-11-23 04:31:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 04:31:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-11-23 04:31:18,919 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-11-23 04:31:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:18,919 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-11-23 04:31:18,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:31:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-11-23 04:31:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:31:18,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:18,921 INFO L402 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] [2018-11-23 04:31:18,921 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:18,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-11-23 04:31:18,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:18,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:18,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:18,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:18,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:31:18,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:18,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:31:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:31:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:31:18,996 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-11-23 04:31:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:20,236 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-11-23 04:31:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 04:31:20,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 04:31:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:20,239 INFO L225 Difference]: With dead ends: 1188 [2018-11-23 04:31:20,239 INFO L226 Difference]: Without dead ends: 1119 [2018-11-23 04:31:20,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:31:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-23 04:31:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-11-23 04:31:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-23 04:31:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-11-23 04:31:20,275 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-11-23 04:31:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:20,275 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-11-23 04:31:20,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:31:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-11-23 04:31:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 04:31:20,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:20,277 INFO L402 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] [2018-11-23 04:31:20,277 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:20,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-11-23 04:31:20,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:20,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:20,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:20,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:20,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:20,308 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-11-23 04:31:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:20,372 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-11-23 04:31:20,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:20,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-23 04:31:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:20,375 INFO L225 Difference]: With dead ends: 912 [2018-11-23 04:31:20,375 INFO L226 Difference]: Without dead ends: 907 [2018-11-23 04:31:20,376 INFO L631 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 [2018-11-23 04:31:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-23 04:31:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-11-23 04:31:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-11-23 04:31:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-11-23 04:31:20,408 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-11-23 04:31:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:20,409 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-11-23 04:31:20,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-11-23 04:31:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 04:31:20,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:20,410 INFO L402 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] [2018-11-23 04:31:20,411 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:20,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-11-23 04:31:20,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:20,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:20,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:20,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:20,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:20,435 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-11-23 04:31:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:20,497 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-11-23 04:31:20,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:20,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-23 04:31:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:20,500 INFO L225 Difference]: With dead ends: 1116 [2018-11-23 04:31:20,500 INFO L226 Difference]: Without dead ends: 875 [2018-11-23 04:31:20,501 INFO L631 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 [2018-11-23 04:31:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-11-23 04:31:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-11-23 04:31:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 04:31:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-11-23 04:31:20,532 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-11-23 04:31:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:20,532 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-11-23 04:31:20,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-11-23 04:31:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 04:31:20,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:20,534 INFO L402 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] [2018-11-23 04:31:20,534 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:20,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-11-23 04:31:20,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:20,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:20,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:20,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:20,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:20,586 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-11-23 04:31:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:20,924 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-11-23 04:31:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:20,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 04:31:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:20,927 INFO L225 Difference]: With dead ends: 885 [2018-11-23 04:31:20,927 INFO L226 Difference]: Without dead ends: 879 [2018-11-23 04:31:20,928 INFO L631 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 [2018-11-23 04:31:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-23 04:31:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-11-23 04:31:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 04:31:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-11-23 04:31:20,960 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-11-23 04:31:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:20,961 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-11-23 04:31:20,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-11-23 04:31:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 04:31:20,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:20,963 INFO L402 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] [2018-11-23 04:31:20,963 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-11-23 04:31:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:20,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:21,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:21,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:21,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:21,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:21,009 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-11-23 04:31:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:21,323 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-11-23 04:31:21,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:21,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-23 04:31:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:21,327 INFO L225 Difference]: With dead ends: 887 [2018-11-23 04:31:21,327 INFO L226 Difference]: Without dead ends: 851 [2018-11-23 04:31:21,328 INFO L631 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 [2018-11-23 04:31:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-23 04:31:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-11-23 04:31:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-23 04:31:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-11-23 04:31:21,361 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-11-23 04:31:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:21,362 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-11-23 04:31:21,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-11-23 04:31:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 04:31:21,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:21,364 INFO L402 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] [2018-11-23 04:31:21,364 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:21,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-11-23 04:31:21,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:21,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:21,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:21,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:21,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:21,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:21,401 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-11-23 04:31:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:21,716 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-11-23 04:31:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:21,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-23 04:31:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:21,719 INFO L225 Difference]: With dead ends: 855 [2018-11-23 04:31:21,719 INFO L226 Difference]: Without dead ends: 849 [2018-11-23 04:31:21,720 INFO L631 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 [2018-11-23 04:31:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-23 04:31:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-11-23 04:31:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-11-23 04:31:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-11-23 04:31:21,751 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-11-23 04:31:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:21,752 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-11-23 04:31:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-11-23 04:31:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 04:31:21,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:21,754 INFO L402 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] [2018-11-23 04:31:21,754 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-11-23 04:31:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:21,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:31:21,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:21,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:31:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:31:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:31:21,797 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-11-23 04:31:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:21,893 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-11-23 04:31:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:31:21,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-23 04:31:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:21,896 INFO L225 Difference]: With dead ends: 886 [2018-11-23 04:31:21,896 INFO L226 Difference]: Without dead ends: 854 [2018-11-23 04:31:21,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-23 04:31:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-11-23 04:31:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-23 04:31:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-11-23 04:31:21,932 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-11-23 04:31:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:21,932 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-11-23 04:31:21,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:31:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-11-23 04:31:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 04:31:21,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:21,934 INFO L402 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] [2018-11-23 04:31:21,935 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:21,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-11-23 04:31:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:21,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:21,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:21,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:31:21,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:21,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:31:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:31:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:31:21,997 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-11-23 04:31:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:22,144 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-11-23 04:31:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:31:22,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 04:31:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:22,147 INFO L225 Difference]: With dead ends: 876 [2018-11-23 04:31:22,147 INFO L226 Difference]: Without dead ends: 838 [2018-11-23 04:31:22,147 INFO L631 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 [2018-11-23 04:31:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-23 04:31:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-23 04:31:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-23 04:31:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-11-23 04:31:22,190 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-11-23 04:31:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:22,190 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-11-23 04:31:22,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:31:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-11-23 04:31:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 04:31:22,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:22,192 INFO L402 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] [2018-11-23 04:31:22,192 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:22,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-11-23 04:31:22,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:22,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:22,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 04:31:22,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:22,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:22,324 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-11-23 04:31:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:22,480 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-11-23 04:31:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:31:22,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-23 04:31:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:22,483 INFO L225 Difference]: With dead ends: 854 [2018-11-23 04:31:22,483 INFO L226 Difference]: Without dead ends: 836 [2018-11-23 04:31:22,483 INFO L631 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 [2018-11-23 04:31:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-11-23 04:31:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-11-23 04:31:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-11-23 04:31:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-11-23 04:31:22,515 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2018-11-23 04:31:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:22,515 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-11-23 04:31:22,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-11-23 04:31:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 04:31:22,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:22,517 INFO L402 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] [2018-11-23 04:31:22,517 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:22,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:22,517 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-11-23 04:31:22,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:22,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:22,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 04:31:22,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:22,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:22,595 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-11-23 04:31:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:22,731 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-11-23 04:31:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:31:22,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-23 04:31:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:22,734 INFO L225 Difference]: With dead ends: 849 [2018-11-23 04:31:22,734 INFO L226 Difference]: Without dead ends: 831 [2018-11-23 04:31:22,735 INFO L631 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 [2018-11-23 04:31:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-23 04:31:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-11-23 04:31:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-11-23 04:31:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-11-23 04:31:22,768 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2018-11-23 04:31:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:22,768 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-11-23 04:31:22,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-11-23 04:31:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 04:31:22,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:22,770 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 04:31:22,770 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:22,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1868951225, now seen corresponding path program 1 times [2018-11-23 04:31:22,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:22,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:22,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:22,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:22,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:22,809 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 3 states. [2018-11-23 04:31:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:22,856 INFO L93 Difference]: Finished difference Result 1084 states and 1452 transitions. [2018-11-23 04:31:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:22,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-23 04:31:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:22,859 INFO L225 Difference]: With dead ends: 1084 [2018-11-23 04:31:22,859 INFO L226 Difference]: Without dead ends: 921 [2018-11-23 04:31:22,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-23 04:31:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 890. [2018-11-23 04:31:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-11-23 04:31:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1194 transitions. [2018-11-23 04:31:22,897 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1194 transitions. Word has length 74 [2018-11-23 04:31:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:22,897 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1194 transitions. [2018-11-23 04:31:22,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1194 transitions. [2018-11-23 04:31:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 04:31:22,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:22,899 INFO L402 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] [2018-11-23 04:31:22,899 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:22,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-11-23 04:31:22,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:22,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:22,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:22,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:23,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:23,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:23,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:23,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:23,006 INFO L87 Difference]: Start difference. First operand 890 states and 1194 transitions. Second operand 11 states. [2018-11-23 04:31:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:23,169 INFO L93 Difference]: Finished difference Result 907 states and 1212 transitions. [2018-11-23 04:31:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:23,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-23 04:31:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:23,172 INFO L225 Difference]: With dead ends: 907 [2018-11-23 04:31:23,172 INFO L226 Difference]: Without dead ends: 887 [2018-11-23 04:31:23,173 INFO L631 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 [2018-11-23 04:31:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-23 04:31:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2018-11-23 04:31:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-23 04:31:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1189 transitions. [2018-11-23 04:31:23,209 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1189 transitions. Word has length 58 [2018-11-23 04:31:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:23,210 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1189 transitions. [2018-11-23 04:31:23,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1189 transitions. [2018-11-23 04:31:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 04:31:23,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:23,212 INFO L402 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] [2018-11-23 04:31:23,212 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:23,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-11-23 04:31:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:23,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:23,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:23,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:23,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:23,303 INFO L87 Difference]: Start difference. First operand 887 states and 1189 transitions. Second operand 12 states. [2018-11-23 04:31:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:23,461 INFO L93 Difference]: Finished difference Result 913 states and 1217 transitions. [2018-11-23 04:31:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:23,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-23 04:31:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:23,465 INFO L225 Difference]: With dead ends: 913 [2018-11-23 04:31:23,465 INFO L226 Difference]: Without dead ends: 888 [2018-11-23 04:31:23,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-23 04:31:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-23 04:31:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2018-11-23 04:31:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-23 04:31:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2018-11-23 04:31:23,531 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 59 [2018-11-23 04:31:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:23,531 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2018-11-23 04:31:23,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2018-11-23 04:31:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 04:31:23,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:23,533 INFO L402 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] [2018-11-23 04:31:23,533 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:23,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-11-23 04:31:23,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:23,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:23,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:23,593 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand 3 states. [2018-11-23 04:31:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:23,623 INFO L93 Difference]: Finished difference Result 920 states and 1212 transitions. [2018-11-23 04:31:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:23,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-23 04:31:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:23,626 INFO L225 Difference]: With dead ends: 920 [2018-11-23 04:31:23,626 INFO L226 Difference]: Without dead ends: 888 [2018-11-23 04:31:23,627 INFO L631 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 [2018-11-23 04:31:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-23 04:31:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2018-11-23 04:31:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-23 04:31:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1177 transitions. [2018-11-23 04:31:23,661 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1177 transitions. Word has length 59 [2018-11-23 04:31:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:23,661 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1177 transitions. [2018-11-23 04:31:23,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1177 transitions. [2018-11-23 04:31:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 04:31:23,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:23,663 INFO L402 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] [2018-11-23 04:31:23,663 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:23,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-11-23 04:31:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:23,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:23,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:31:23,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:23,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:31:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:31:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:31:23,727 INFO L87 Difference]: Start difference. First operand 886 states and 1177 transitions. Second operand 9 states. [2018-11-23 04:31:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:23,835 INFO L93 Difference]: Finished difference Result 908 states and 1200 transitions. [2018-11-23 04:31:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:31:23,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-23 04:31:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:23,838 INFO L225 Difference]: With dead ends: 908 [2018-11-23 04:31:23,838 INFO L226 Difference]: Without dead ends: 874 [2018-11-23 04:31:23,838 INFO L631 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 [2018-11-23 04:31:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-23 04:31:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-11-23 04:31:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-23 04:31:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1157 transitions. [2018-11-23 04:31:23,872 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1157 transitions. Word has length 59 [2018-11-23 04:31:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:23,872 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1157 transitions. [2018-11-23 04:31:23,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:31:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1157 transitions. [2018-11-23 04:31:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 04:31:23,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:23,874 INFO L402 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] [2018-11-23 04:31:23,874 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:23,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-11-23 04:31:23,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:23,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:23,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:23,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:31:23,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:31:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:31:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:31:23,907 INFO L87 Difference]: Start difference. First operand 874 states and 1157 transitions. Second operand 4 states. [2018-11-23 04:31:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:24,001 INFO L93 Difference]: Finished difference Result 1034 states and 1385 transitions. [2018-11-23 04:31:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:31:24,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-23 04:31:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:24,004 INFO L225 Difference]: With dead ends: 1034 [2018-11-23 04:31:24,004 INFO L226 Difference]: Without dead ends: 923 [2018-11-23 04:31:24,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-23 04:31:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 881. [2018-11-23 04:31:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-11-23 04:31:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1173 transitions. [2018-11-23 04:31:24,041 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1173 transitions. Word has length 60 [2018-11-23 04:31:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:24,041 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1173 transitions. [2018-11-23 04:31:24,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:31:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1173 transitions. [2018-11-23 04:31:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 04:31:24,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:24,043 INFO L402 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] [2018-11-23 04:31:24,044 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:24,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-11-23 04:31:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:24,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:24,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:24,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:24,118 INFO L87 Difference]: Start difference. First operand 881 states and 1173 transitions. Second operand 11 states. [2018-11-23 04:31:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:24,201 INFO L93 Difference]: Finished difference Result 950 states and 1266 transitions. [2018-11-23 04:31:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:24,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-23 04:31:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:24,204 INFO L225 Difference]: With dead ends: 950 [2018-11-23 04:31:24,204 INFO L226 Difference]: Without dead ends: 895 [2018-11-23 04:31:24,205 INFO L631 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 [2018-11-23 04:31:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-11-23 04:31:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 885. [2018-11-23 04:31:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-11-23 04:31:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1191 transitions. [2018-11-23 04:31:24,240 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1191 transitions. Word has length 60 [2018-11-23 04:31:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:24,240 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1191 transitions. [2018-11-23 04:31:24,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1191 transitions. [2018-11-23 04:31:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 04:31:24,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:24,242 INFO L402 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] [2018-11-23 04:31:24,242 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:24,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-11-23 04:31:24,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:24,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:31:24,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:24,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:31:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:31:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:31:24,295 INFO L87 Difference]: Start difference. First operand 885 states and 1191 transitions. Second operand 9 states. [2018-11-23 04:31:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:24,402 INFO L93 Difference]: Finished difference Result 916 states and 1228 transitions. [2018-11-23 04:31:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:31:24,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 04:31:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:24,405 INFO L225 Difference]: With dead ends: 916 [2018-11-23 04:31:24,405 INFO L226 Difference]: Without dead ends: 877 [2018-11-23 04:31:24,406 INFO L631 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 [2018-11-23 04:31:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-23 04:31:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2018-11-23 04:31:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-11-23 04:31:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1175 transitions. [2018-11-23 04:31:24,441 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1175 transitions. Word has length 60 [2018-11-23 04:31:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:24,441 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1175 transitions. [2018-11-23 04:31:24,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:31:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1175 transitions. [2018-11-23 04:31:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 04:31:24,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:24,443 INFO L402 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] [2018-11-23 04:31:24,443 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:24,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-11-23 04:31:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:24,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:24,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:24,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:24,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:24,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:24,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:24,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:24,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:24,543 INFO L87 Difference]: Start difference. First operand 877 states and 1175 transitions. Second operand 13 states. [2018-11-23 04:31:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:24,720 INFO L93 Difference]: Finished difference Result 894 states and 1193 transitions. [2018-11-23 04:31:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:24,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-23 04:31:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:24,724 INFO L225 Difference]: With dead ends: 894 [2018-11-23 04:31:24,724 INFO L226 Difference]: Without dead ends: 872 [2018-11-23 04:31:24,725 INFO L631 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 [2018-11-23 04:31:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-23 04:31:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2018-11-23 04:31:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 04:31:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1168 transitions. [2018-11-23 04:31:24,764 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1168 transitions. Word has length 63 [2018-11-23 04:31:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:24,764 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1168 transitions. [2018-11-23 04:31:24,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1168 transitions. [2018-11-23 04:31:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 04:31:24,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:24,767 INFO L402 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] [2018-11-23 04:31:24,767 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:24,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-11-23 04:31:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:24,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:24,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:24,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:24,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:24,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:24,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:24,887 INFO L87 Difference]: Start difference. First operand 872 states and 1168 transitions. Second operand 13 states. [2018-11-23 04:31:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:25,101 INFO L93 Difference]: Finished difference Result 889 states and 1186 transitions. [2018-11-23 04:31:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:25,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 04:31:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:25,104 INFO L225 Difference]: With dead ends: 889 [2018-11-23 04:31:25,105 INFO L226 Difference]: Without dead ends: 867 [2018-11-23 04:31:25,105 INFO L631 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 [2018-11-23 04:31:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-23 04:31:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2018-11-23 04:31:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-11-23 04:31:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1161 transitions. [2018-11-23 04:31:25,159 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1161 transitions. Word has length 62 [2018-11-23 04:31:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:25,159 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1161 transitions. [2018-11-23 04:31:25,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1161 transitions. [2018-11-23 04:31:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 04:31:25,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:25,162 INFO L402 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] [2018-11-23 04:31:25,162 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:25,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-11-23 04:31:25,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:25,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:25,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:25,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:25,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:25,204 INFO L87 Difference]: Start difference. First operand 867 states and 1161 transitions. Second operand 3 states. [2018-11-23 04:31:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:25,256 INFO L93 Difference]: Finished difference Result 1153 states and 1544 transitions. [2018-11-23 04:31:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:25,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-23 04:31:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:25,259 INFO L225 Difference]: With dead ends: 1153 [2018-11-23 04:31:25,259 INFO L226 Difference]: Without dead ends: 792 [2018-11-23 04:31:25,260 INFO L631 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 [2018-11-23 04:31:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-23 04:31:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 761. [2018-11-23 04:31:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-23 04:31:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 988 transitions. [2018-11-23 04:31:25,309 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 988 transitions. Word has length 62 [2018-11-23 04:31:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:25,309 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 988 transitions. [2018-11-23 04:31:25,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 988 transitions. [2018-11-23 04:31:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 04:31:25,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:25,311 INFO L402 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] [2018-11-23 04:31:25,311 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:25,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash 551685876, now seen corresponding path program 1 times [2018-11-23 04:31:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:25,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:25,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:25,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:25,418 INFO L87 Difference]: Start difference. First operand 761 states and 988 transitions. Second operand 12 states. [2018-11-23 04:31:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:25,644 INFO L93 Difference]: Finished difference Result 785 states and 1013 transitions. [2018-11-23 04:31:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:25,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-23 04:31:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:25,647 INFO L225 Difference]: With dead ends: 785 [2018-11-23 04:31:25,647 INFO L226 Difference]: Without dead ends: 761 [2018-11-23 04:31:25,647 INFO L631 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 [2018-11-23 04:31:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-23 04:31:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 759. [2018-11-23 04:31:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-23 04:31:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 984 transitions. [2018-11-23 04:31:25,695 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 984 transitions. Word has length 66 [2018-11-23 04:31:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:25,695 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 984 transitions. [2018-11-23 04:31:25,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 984 transitions. [2018-11-23 04:31:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 04:31:25,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:25,700 INFO L402 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] [2018-11-23 04:31:25,700 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:25,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-11-23 04:31:25,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:25,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:25,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:25,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:25,821 INFO L87 Difference]: Start difference. First operand 759 states and 984 transitions. Second operand 12 states. [2018-11-23 04:31:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:26,072 INFO L93 Difference]: Finished difference Result 781 states and 1007 transitions. [2018-11-23 04:31:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:26,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-23 04:31:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:26,074 INFO L225 Difference]: With dead ends: 781 [2018-11-23 04:31:26,075 INFO L226 Difference]: Without dead ends: 757 [2018-11-23 04:31:26,075 INFO L631 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 [2018-11-23 04:31:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-23 04:31:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-11-23 04:31:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-23 04:31:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 980 transitions. [2018-11-23 04:31:26,124 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 980 transitions. Word has length 63 [2018-11-23 04:31:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:26,125 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 980 transitions. [2018-11-23 04:31:26,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 980 transitions. [2018-11-23 04:31:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 04:31:26,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:26,126 INFO L402 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] [2018-11-23 04:31:26,127 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:26,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 111591861, now seen corresponding path program 1 times [2018-11-23 04:31:26,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:26,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:26,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:26,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:26,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:26,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:26,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:26,191 INFO L87 Difference]: Start difference. First operand 757 states and 980 transitions. Second operand 5 states. [2018-11-23 04:31:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:26,334 INFO L93 Difference]: Finished difference Result 791 states and 1019 transitions. [2018-11-23 04:31:26,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:26,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-23 04:31:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:26,337 INFO L225 Difference]: With dead ends: 791 [2018-11-23 04:31:26,337 INFO L226 Difference]: Without dead ends: 764 [2018-11-23 04:31:26,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-23 04:31:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 762. [2018-11-23 04:31:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-23 04:31:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 988 transitions. [2018-11-23 04:31:26,392 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 988 transitions. Word has length 67 [2018-11-23 04:31:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:26,392 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 988 transitions. [2018-11-23 04:31:26,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 988 transitions. [2018-11-23 04:31:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 04:31:26,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:26,394 INFO L402 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] [2018-11-23 04:31:26,394 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:26,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:26,394 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-11-23 04:31:26,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:26,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:26,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:26,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:26,505 INFO L87 Difference]: Start difference. First operand 762 states and 988 transitions. Second operand 12 states. [2018-11-23 04:31:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:26,760 INFO L93 Difference]: Finished difference Result 786 states and 1013 transitions. [2018-11-23 04:31:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:26,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-23 04:31:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:26,764 INFO L225 Difference]: With dead ends: 786 [2018-11-23 04:31:26,764 INFO L226 Difference]: Without dead ends: 762 [2018-11-23 04:31:26,765 INFO L631 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 [2018-11-23 04:31:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-23 04:31:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2018-11-23 04:31:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-23 04:31:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 984 transitions. [2018-11-23 04:31:26,815 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 984 transitions. Word has length 67 [2018-11-23 04:31:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:26,815 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 984 transitions. [2018-11-23 04:31:26,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 984 transitions. [2018-11-23 04:31:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 04:31:26,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:26,817 INFO L402 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] [2018-11-23 04:31:26,817 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-11-23 04:31:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:26,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:26,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:26,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:26,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:26,932 INFO L87 Difference]: Start difference. First operand 760 states and 984 transitions. Second operand 12 states. [2018-11-23 04:31:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:27,159 INFO L93 Difference]: Finished difference Result 782 states and 1007 transitions. [2018-11-23 04:31:27,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:27,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 04:31:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:27,163 INFO L225 Difference]: With dead ends: 782 [2018-11-23 04:31:27,163 INFO L226 Difference]: Without dead ends: 758 [2018-11-23 04:31:27,164 INFO L631 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 [2018-11-23 04:31:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-11-23 04:31:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 753. [2018-11-23 04:31:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-23 04:31:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 972 transitions. [2018-11-23 04:31:27,235 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 972 transitions. Word has length 62 [2018-11-23 04:31:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:27,235 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 972 transitions. [2018-11-23 04:31:27,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 972 transitions. [2018-11-23 04:31:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 04:31:27,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:27,237 INFO L402 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] [2018-11-23 04:31:27,237 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:27,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-11-23 04:31:27,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:27,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:27,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:27,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:27,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:27,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:27,264 INFO L87 Difference]: Start difference. First operand 753 states and 972 transitions. Second operand 3 states. [2018-11-23 04:31:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:27,317 INFO L93 Difference]: Finished difference Result 883 states and 1145 transitions. [2018-11-23 04:31:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:27,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 04:31:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:27,320 INFO L225 Difference]: With dead ends: 883 [2018-11-23 04:31:27,320 INFO L226 Difference]: Without dead ends: 753 [2018-11-23 04:31:27,320 INFO L631 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 [2018-11-23 04:31:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-23 04:31:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-11-23 04:31:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-23 04:31:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 970 transitions. [2018-11-23 04:31:27,367 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 970 transitions. Word has length 66 [2018-11-23 04:31:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:27,367 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 970 transitions. [2018-11-23 04:31:27,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 970 transitions. [2018-11-23 04:31:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:31:27,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:27,368 INFO L402 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] [2018-11-23 04:31:27,369 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:27,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-11-23 04:31:27,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:27,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:27,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:27,407 INFO L87 Difference]: Start difference. First operand 753 states and 970 transitions. Second operand 5 states. [2018-11-23 04:31:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:27,509 INFO L93 Difference]: Finished difference Result 807 states and 1029 transitions. [2018-11-23 04:31:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:27,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 04:31:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:27,512 INFO L225 Difference]: With dead ends: 807 [2018-11-23 04:31:27,512 INFO L226 Difference]: Without dead ends: 755 [2018-11-23 04:31:27,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-23 04:31:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-23 04:31:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-23 04:31:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 969 transitions. [2018-11-23 04:31:27,559 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 969 transitions. Word has length 65 [2018-11-23 04:31:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:27,559 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 969 transitions. [2018-11-23 04:31:27,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 969 transitions. [2018-11-23 04:31:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:31:27,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:27,561 INFO L402 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] [2018-11-23 04:31:27,561 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:27,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-11-23 04:31:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:27,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:27,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:27,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:27,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:27,620 INFO L87 Difference]: Start difference. First operand 753 states and 969 transitions. Second operand 5 states. [2018-11-23 04:31:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:27,814 INFO L93 Difference]: Finished difference Result 817 states and 1044 transitions. [2018-11-23 04:31:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:27,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 04:31:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:27,816 INFO L225 Difference]: With dead ends: 817 [2018-11-23 04:31:27,817 INFO L226 Difference]: Without dead ends: 784 [2018-11-23 04:31:27,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-11-23 04:31:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 759. [2018-11-23 04:31:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-23 04:31:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 976 transitions. [2018-11-23 04:31:27,873 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 976 transitions. Word has length 65 [2018-11-23 04:31:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:27,873 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 976 transitions. [2018-11-23 04:31:27,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 976 transitions. [2018-11-23 04:31:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 04:31:27,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:27,877 INFO L402 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] [2018-11-23 04:31:27,878 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:27,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-11-23 04:31:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:27,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:27,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:27,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:27,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:27,984 INFO L87 Difference]: Start difference. First operand 759 states and 976 transitions. Second operand 11 states. [2018-11-23 04:31:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:28,145 INFO L93 Difference]: Finished difference Result 781 states and 999 transitions. [2018-11-23 04:31:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:28,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-23 04:31:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:28,149 INFO L225 Difference]: With dead ends: 781 [2018-11-23 04:31:28,149 INFO L226 Difference]: Without dead ends: 755 [2018-11-23 04:31:28,150 INFO L631 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 [2018-11-23 04:31:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-23 04:31:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 749. [2018-11-23 04:31:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-11-23 04:31:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 962 transitions. [2018-11-23 04:31:28,199 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 962 transitions. Word has length 66 [2018-11-23 04:31:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:28,200 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 962 transitions. [2018-11-23 04:31:28,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 962 transitions. [2018-11-23 04:31:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 04:31:28,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:28,201 INFO L402 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] [2018-11-23 04:31:28,201 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:28,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-11-23 04:31:28,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:28,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:28,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:28,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:28,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:28,243 INFO L87 Difference]: Start difference. First operand 749 states and 962 transitions. Second operand 5 states. [2018-11-23 04:31:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:28,321 INFO L93 Difference]: Finished difference Result 790 states and 1006 transitions. [2018-11-23 04:31:28,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:28,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-23 04:31:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:28,323 INFO L225 Difference]: With dead ends: 790 [2018-11-23 04:31:28,323 INFO L226 Difference]: Without dead ends: 756 [2018-11-23 04:31:28,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-11-23 04:31:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 749. [2018-11-23 04:31:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-11-23 04:31:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 961 transitions. [2018-11-23 04:31:28,372 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 961 transitions. Word has length 67 [2018-11-23 04:31:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:28,373 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 961 transitions. [2018-11-23 04:31:28,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 961 transitions. [2018-11-23 04:31:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:31:28,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:28,378 INFO L402 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] [2018-11-23 04:31:28,378 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:28,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-11-23 04:31:28,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:28,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:28,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:28,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:28,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:28,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:28,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:28,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:28,457 INFO L87 Difference]: Start difference. First operand 749 states and 961 transitions. Second operand 6 states. [2018-11-23 04:31:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:28,581 INFO L93 Difference]: Finished difference Result 788 states and 1002 transitions. [2018-11-23 04:31:28,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:28,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 04:31:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:28,584 INFO L225 Difference]: With dead ends: 788 [2018-11-23 04:31:28,584 INFO L226 Difference]: Without dead ends: 756 [2018-11-23 04:31:28,584 INFO L631 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 [2018-11-23 04:31:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-11-23 04:31:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 751. [2018-11-23 04:31:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-23 04:31:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 963 transitions. [2018-11-23 04:31:28,626 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 963 transitions. Word has length 68 [2018-11-23 04:31:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:28,626 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 963 transitions. [2018-11-23 04:31:28,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 963 transitions. [2018-11-23 04:31:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:31:28,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:28,628 INFO L402 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] [2018-11-23 04:31:28,628 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:28,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-11-23 04:31:28,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:28,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:28,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:28,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:28,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:28,775 INFO L87 Difference]: Start difference. First operand 751 states and 963 transitions. Second operand 11 states. [2018-11-23 04:31:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:28,915 INFO L93 Difference]: Finished difference Result 776 states and 990 transitions. [2018-11-23 04:31:28,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:28,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 04:31:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:28,918 INFO L225 Difference]: With dead ends: 776 [2018-11-23 04:31:28,918 INFO L226 Difference]: Without dead ends: 743 [2018-11-23 04:31:28,919 INFO L631 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 [2018-11-23 04:31:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-11-23 04:31:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-11-23 04:31:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-11-23 04:31:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 953 transitions. [2018-11-23 04:31:28,966 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 953 transitions. Word has length 68 [2018-11-23 04:31:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:28,967 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 953 transitions. [2018-11-23 04:31:28,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 953 transitions. [2018-11-23 04:31:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:31:28,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:28,968 INFO L402 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] [2018-11-23 04:31:28,969 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:28,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-11-23 04:31:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:28,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:29,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:29,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:29,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:29,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:29,055 INFO L87 Difference]: Start difference. First operand 743 states and 953 transitions. Second operand 6 states. [2018-11-23 04:31:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:29,139 INFO L93 Difference]: Finished difference Result 790 states and 1001 transitions. [2018-11-23 04:31:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:29,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 04:31:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:29,143 INFO L225 Difference]: With dead ends: 790 [2018-11-23 04:31:29,143 INFO L226 Difference]: Without dead ends: 738 [2018-11-23 04:31:29,143 INFO L631 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 [2018-11-23 04:31:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-23 04:31:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-23 04:31:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-23 04:31:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 940 transitions. [2018-11-23 04:31:29,197 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 940 transitions. Word has length 68 [2018-11-23 04:31:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:29,199 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 940 transitions. [2018-11-23 04:31:29,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 940 transitions. [2018-11-23 04:31:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:31:29,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:29,201 INFO L402 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] [2018-11-23 04:31:29,202 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:29,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-11-23 04:31:29,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:29,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:29,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:29,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:29,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:29,324 INFO L87 Difference]: Start difference. First operand 736 states and 940 transitions. Second operand 11 states. [2018-11-23 04:31:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:29,545 INFO L93 Difference]: Finished difference Result 758 states and 963 transitions. [2018-11-23 04:31:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:29,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 04:31:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:29,546 INFO L225 Difference]: With dead ends: 758 [2018-11-23 04:31:29,547 INFO L226 Difference]: Without dead ends: 726 [2018-11-23 04:31:29,547 INFO L631 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 [2018-11-23 04:31:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-23 04:31:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-11-23 04:31:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-23 04:31:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 926 transitions. [2018-11-23 04:31:29,597 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 926 transitions. Word has length 68 [2018-11-23 04:31:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:29,597 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 926 transitions. [2018-11-23 04:31:29,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 926 transitions. [2018-11-23 04:31:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:31:29,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:29,599 INFO L402 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] [2018-11-23 04:31:29,599 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:29,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-11-23 04:31:29,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:29,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:29,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:29,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:29,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:29,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:29,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:29,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:29,663 INFO L87 Difference]: Start difference. First operand 726 states and 926 transitions. Second operand 5 states. [2018-11-23 04:31:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:29,942 INFO L93 Difference]: Finished difference Result 804 states and 1027 transitions. [2018-11-23 04:31:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:29,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-23 04:31:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:29,945 INFO L225 Difference]: With dead ends: 804 [2018-11-23 04:31:29,945 INFO L226 Difference]: Without dead ends: 798 [2018-11-23 04:31:29,945 INFO L631 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 [2018-11-23 04:31:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-11-23 04:31:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 726. [2018-11-23 04:31:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-23 04:31:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 925 transitions. [2018-11-23 04:31:30,000 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 925 transitions. Word has length 68 [2018-11-23 04:31:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,000 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 925 transitions. [2018-11-23 04:31:30,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 925 transitions. [2018-11-23 04:31:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,006 INFO L402 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] [2018-11-23 04:31:30,006 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-11-23 04:31:30,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:30,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:30,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:30,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:30,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:30,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:30,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:30,050 INFO L87 Difference]: Start difference. First operand 726 states and 925 transitions. Second operand 5 states. [2018-11-23 04:31:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:30,146 INFO L93 Difference]: Finished difference Result 767 states and 969 transitions. [2018-11-23 04:31:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:30,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-23 04:31:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:30,150 INFO L225 Difference]: With dead ends: 767 [2018-11-23 04:31:30,150 INFO L226 Difference]: Without dead ends: 733 [2018-11-23 04:31:30,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-23 04:31:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 726. [2018-11-23 04:31:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-23 04:31:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 924 transitions. [2018-11-23 04:31:30,204 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 924 transitions. Word has length 69 [2018-11-23 04:31:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,204 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 924 transitions. [2018-11-23 04:31:30,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 924 transitions. [2018-11-23 04:31:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,210 INFO L402 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] [2018-11-23 04:31:30,210 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-11-23 04:31:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:30,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:30,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:30,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:30,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:30,287 INFO L87 Difference]: Start difference. First operand 726 states and 924 transitions. Second operand 6 states. [2018-11-23 04:31:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:30,379 INFO L93 Difference]: Finished difference Result 765 states and 965 transitions. [2018-11-23 04:31:30,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:30,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 04:31:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:30,382 INFO L225 Difference]: With dead ends: 765 [2018-11-23 04:31:30,382 INFO L226 Difference]: Without dead ends: 733 [2018-11-23 04:31:30,382 INFO L631 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 [2018-11-23 04:31:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-23 04:31:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 728. [2018-11-23 04:31:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-11-23 04:31:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 926 transitions. [2018-11-23 04:31:30,414 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 926 transitions. Word has length 69 [2018-11-23 04:31:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,414 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 926 transitions. [2018-11-23 04:31:30,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 926 transitions. [2018-11-23 04:31:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,416 INFO L402 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] [2018-11-23 04:31:30,416 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-11-23 04:31:30,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:30,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:30,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:30,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:30,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:30,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:30,487 INFO L87 Difference]: Start difference. First operand 728 states and 926 transitions. Second operand 11 states. [2018-11-23 04:31:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:30,585 INFO L93 Difference]: Finished difference Result 753 states and 953 transitions. [2018-11-23 04:31:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:30,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 04:31:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:30,588 INFO L225 Difference]: With dead ends: 753 [2018-11-23 04:31:30,588 INFO L226 Difference]: Without dead ends: 721 [2018-11-23 04:31:30,588 INFO L631 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 [2018-11-23 04:31:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-23 04:31:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-23 04:31:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-23 04:31:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 917 transitions. [2018-11-23 04:31:30,618 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 917 transitions. Word has length 69 [2018-11-23 04:31:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,618 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 917 transitions. [2018-11-23 04:31:30,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2018-11-23 04:31:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,620 INFO L402 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] [2018-11-23 04:31:30,620 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-11-23 04:31:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:30,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:30,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:30,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:30,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:30,684 INFO L87 Difference]: Start difference. First operand 721 states and 917 transitions. Second operand 6 states. [2018-11-23 04:31:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:30,745 INFO L93 Difference]: Finished difference Result 760 states and 958 transitions. [2018-11-23 04:31:30,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:30,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 04:31:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:30,749 INFO L225 Difference]: With dead ends: 760 [2018-11-23 04:31:30,749 INFO L226 Difference]: Without dead ends: 728 [2018-11-23 04:31:30,749 INFO L631 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 [2018-11-23 04:31:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-23 04:31:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 723. [2018-11-23 04:31:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-23 04:31:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 919 transitions. [2018-11-23 04:31:30,783 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 919 transitions. Word has length 69 [2018-11-23 04:31:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,783 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 919 transitions. [2018-11-23 04:31:30,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 919 transitions. [2018-11-23 04:31:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,785 INFO L402 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] [2018-11-23 04:31:30,785 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-11-23 04:31:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:30,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:30,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:30,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:30,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:30,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:30,858 INFO L87 Difference]: Start difference. First operand 723 states and 919 transitions. Second operand 11 states. [2018-11-23 04:31:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:30,951 INFO L93 Difference]: Finished difference Result 748 states and 946 transitions. [2018-11-23 04:31:30,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:30,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 04:31:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:30,953 INFO L225 Difference]: With dead ends: 748 [2018-11-23 04:31:30,953 INFO L226 Difference]: Without dead ends: 718 [2018-11-23 04:31:30,955 INFO L631 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 [2018-11-23 04:31:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-11-23 04:31:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-11-23 04:31:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-23 04:31:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 912 transitions. [2018-11-23 04:31:30,983 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 912 transitions. Word has length 69 [2018-11-23 04:31:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 912 transitions. [2018-11-23 04:31:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 912 transitions. [2018-11-23 04:31:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:30,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:30,985 INFO L402 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] [2018-11-23 04:31:30,985 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:30,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-11-23 04:31:30,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:30,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:31,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:31,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:31,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:31,100 INFO L87 Difference]: Start difference. First operand 718 states and 912 transitions. Second operand 11 states. [2018-11-23 04:31:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:31,218 INFO L93 Difference]: Finished difference Result 728 states and 921 transitions. [2018-11-23 04:31:31,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:31,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-23 04:31:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:31,220 INFO L225 Difference]: With dead ends: 728 [2018-11-23 04:31:31,220 INFO L226 Difference]: Without dead ends: 722 [2018-11-23 04:31:31,220 INFO L631 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 [2018-11-23 04:31:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-23 04:31:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 716. [2018-11-23 04:31:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-11-23 04:31:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 908 transitions. [2018-11-23 04:31:31,249 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 908 transitions. Word has length 69 [2018-11-23 04:31:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:31,249 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 908 transitions. [2018-11-23 04:31:31,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 908 transitions. [2018-11-23 04:31:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:31,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:31,250 INFO L402 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] [2018-11-23 04:31:31,250 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:31,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-11-23 04:31:31,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:31,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:31,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:31,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:31,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:31,310 INFO L87 Difference]: Start difference. First operand 716 states and 908 transitions. Second operand 5 states. [2018-11-23 04:31:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:31,565 INFO L93 Difference]: Finished difference Result 790 states and 1005 transitions. [2018-11-23 04:31:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:31,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-23 04:31:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:31,567 INFO L225 Difference]: With dead ends: 790 [2018-11-23 04:31:31,567 INFO L226 Difference]: Without dead ends: 728 [2018-11-23 04:31:31,567 INFO L631 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 [2018-11-23 04:31:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-23 04:31:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 660. [2018-11-23 04:31:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-23 04:31:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 837 transitions. [2018-11-23 04:31:31,601 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 837 transitions. Word has length 69 [2018-11-23 04:31:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:31,601 INFO L480 AbstractCegarLoop]: Abstraction has 660 states and 837 transitions. [2018-11-23 04:31:31,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 837 transitions. [2018-11-23 04:31:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 04:31:31,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:31,603 INFO L402 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] [2018-11-23 04:31:31,603 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:31,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-11-23 04:31:31,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:31,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:31,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 04:31:31,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:31,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 04:31:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:31:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:31,748 INFO L87 Difference]: Start difference. First operand 660 states and 837 transitions. Second operand 12 states. [2018-11-23 04:31:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:31,883 INFO L93 Difference]: Finished difference Result 688 states and 869 transitions. [2018-11-23 04:31:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:31,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 04:31:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:31,886 INFO L225 Difference]: With dead ends: 688 [2018-11-23 04:31:31,886 INFO L226 Difference]: Without dead ends: 665 [2018-11-23 04:31:31,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 04:31:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-11-23 04:31:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2018-11-23 04:31:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-23 04:31:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 844 transitions. [2018-11-23 04:31:31,933 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 844 transitions. Word has length 70 [2018-11-23 04:31:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:31,933 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 844 transitions. [2018-11-23 04:31:31,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 04:31:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 844 transitions. [2018-11-23 04:31:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 04:31:31,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:31,935 INFO L402 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] [2018-11-23 04:31:31,935 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:31,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-11-23 04:31:31,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:31,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:32,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:32,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:31:32,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:31:32,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:31:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:32,026 INFO L87 Difference]: Start difference. First operand 665 states and 844 transitions. Second operand 7 states. [2018-11-23 04:31:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:32,130 INFO L93 Difference]: Finished difference Result 711 states and 891 transitions. [2018-11-23 04:31:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:31:32,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-23 04:31:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:32,131 INFO L225 Difference]: With dead ends: 711 [2018-11-23 04:31:32,132 INFO L226 Difference]: Without dead ends: 666 [2018-11-23 04:31:32,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-23 04:31:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2018-11-23 04:31:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-11-23 04:31:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 840 transitions. [2018-11-23 04:31:32,173 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 840 transitions. Word has length 74 [2018-11-23 04:31:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:32,173 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 840 transitions. [2018-11-23 04:31:32,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:31:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 840 transitions. [2018-11-23 04:31:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 04:31:32,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:32,175 INFO L402 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] [2018-11-23 04:31:32,175 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:32,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-11-23 04:31:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:32,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:32,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:32,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:32,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:32,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:32,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:32,272 INFO L87 Difference]: Start difference. First operand 664 states and 840 transitions. Second operand 14 states. [2018-11-23 04:31:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:32,464 INFO L93 Difference]: Finished difference Result 688 states and 866 transitions. [2018-11-23 04:31:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:32,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-23 04:31:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:32,466 INFO L225 Difference]: With dead ends: 688 [2018-11-23 04:31:32,466 INFO L226 Difference]: Without dead ends: 661 [2018-11-23 04:31:32,467 INFO L631 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 [2018-11-23 04:31:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-23 04:31:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-11-23 04:31:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-11-23 04:31:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 835 transitions. [2018-11-23 04:31:32,510 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 835 transitions. Word has length 70 [2018-11-23 04:31:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:32,510 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 835 transitions. [2018-11-23 04:31:32,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 835 transitions. [2018-11-23 04:31:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 04:31:32,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:32,512 INFO L402 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] [2018-11-23 04:31:32,512 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:32,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-11-23 04:31:32,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:32,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:32,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:32,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:32,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:32,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:32,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:32,657 INFO L87 Difference]: Start difference. First operand 661 states and 835 transitions. Second operand 13 states. [2018-11-23 04:31:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:32,860 INFO L93 Difference]: Finished difference Result 678 states and 853 transitions. [2018-11-23 04:31:32,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:32,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-23 04:31:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:32,862 INFO L225 Difference]: With dead ends: 678 [2018-11-23 04:31:32,862 INFO L226 Difference]: Without dead ends: 649 [2018-11-23 04:31:32,863 INFO L631 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 [2018-11-23 04:31:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-23 04:31:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2018-11-23 04:31:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-11-23 04:31:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 819 transitions. [2018-11-23 04:31:32,889 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 819 transitions. Word has length 69 [2018-11-23 04:31:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 819 transitions. [2018-11-23 04:31:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 819 transitions. [2018-11-23 04:31:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 04:31:32,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:32,891 INFO L402 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] [2018-11-23 04:31:32,891 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:32,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-11-23 04:31:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:32,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:32,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:32,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:32,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:32,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:32,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:32,928 INFO L87 Difference]: Start difference. First operand 649 states and 819 transitions. Second operand 5 states. [2018-11-23 04:31:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:32,965 INFO L93 Difference]: Finished difference Result 696 states and 868 transitions. [2018-11-23 04:31:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:32,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-23 04:31:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:32,967 INFO L225 Difference]: With dead ends: 696 [2018-11-23 04:31:32,967 INFO L226 Difference]: Without dead ends: 653 [2018-11-23 04:31:32,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-23 04:31:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-11-23 04:31:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-11-23 04:31:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 818 transitions. [2018-11-23 04:31:32,995 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 818 transitions. Word has length 71 [2018-11-23 04:31:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 818 transitions. [2018-11-23 04:31:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 818 transitions. [2018-11-23 04:31:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 04:31:32,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:32,996 INFO L402 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] [2018-11-23 04:31:32,996 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:32,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-11-23 04:31:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:32,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:33,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:33,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:33,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:33,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:33,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:33,103 INFO L87 Difference]: Start difference. First operand 649 states and 818 transitions. Second operand 14 states. [2018-11-23 04:31:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:33,223 INFO L93 Difference]: Finished difference Result 671 states and 841 transitions. [2018-11-23 04:31:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:33,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-23 04:31:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:33,225 INFO L225 Difference]: With dead ends: 671 [2018-11-23 04:31:33,225 INFO L226 Difference]: Without dead ends: 639 [2018-11-23 04:31:33,225 INFO L631 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 [2018-11-23 04:31:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-23 04:31:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-11-23 04:31:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-11-23 04:31:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 803 transitions. [2018-11-23 04:31:33,253 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 803 transitions. Word has length 74 [2018-11-23 04:31:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:33,253 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 803 transitions. [2018-11-23 04:31:33,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 803 transitions. [2018-11-23 04:31:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 04:31:33,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:33,254 INFO L402 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] [2018-11-23 04:31:33,254 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:33,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-11-23 04:31:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:33,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:33,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:33,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:33,348 INFO L87 Difference]: Start difference. First operand 639 states and 803 transitions. Second operand 14 states. [2018-11-23 04:31:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:33,479 INFO L93 Difference]: Finished difference Result 663 states and 829 transitions. [2018-11-23 04:31:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:33,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 04:31:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:33,480 INFO L225 Difference]: With dead ends: 663 [2018-11-23 04:31:33,480 INFO L226 Difference]: Without dead ends: 632 [2018-11-23 04:31:33,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:31:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-23 04:31:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2018-11-23 04:31:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-23 04:31:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 793 transitions. [2018-11-23 04:31:33,511 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 793 transitions. Word has length 71 [2018-11-23 04:31:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:33,511 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 793 transitions. [2018-11-23 04:31:33,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 793 transitions. [2018-11-23 04:31:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 04:31:33,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:33,512 INFO L402 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] [2018-11-23 04:31:33,512 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:33,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-11-23 04:31:33,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:33,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:33,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:33,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:33,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:33,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:33,618 INFO L87 Difference]: Start difference. First operand 632 states and 793 transitions. Second operand 14 states. [2018-11-23 04:31:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:33,756 INFO L93 Difference]: Finished difference Result 696 states and 861 transitions. [2018-11-23 04:31:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:33,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 04:31:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:33,757 INFO L225 Difference]: With dead ends: 696 [2018-11-23 04:31:33,757 INFO L226 Difference]: Without dead ends: 626 [2018-11-23 04:31:33,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:31:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-11-23 04:31:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-11-23 04:31:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-23 04:31:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 784 transitions. [2018-11-23 04:31:33,782 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 784 transitions. Word has length 71 [2018-11-23 04:31:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:33,783 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 784 transitions. [2018-11-23 04:31:33,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 784 transitions. [2018-11-23 04:31:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 04:31:33,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:33,783 INFO L402 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] [2018-11-23 04:31:33,783 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:33,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-11-23 04:31:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:33,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:33,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:33,834 INFO L87 Difference]: Start difference. First operand 626 states and 784 transitions. Second operand 11 states. [2018-11-23 04:31:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:33,922 INFO L93 Difference]: Finished difference Result 653 states and 814 transitions. [2018-11-23 04:31:33,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:33,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-23 04:31:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:33,923 INFO L225 Difference]: With dead ends: 653 [2018-11-23 04:31:33,923 INFO L226 Difference]: Without dead ends: 608 [2018-11-23 04:31:33,924 INFO L631 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 [2018-11-23 04:31:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-23 04:31:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2018-11-23 04:31:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-23 04:31:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 756 transitions. [2018-11-23 04:31:33,949 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 756 transitions. Word has length 72 [2018-11-23 04:31:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:33,949 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 756 transitions. [2018-11-23 04:31:33,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 756 transitions. [2018-11-23 04:31:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 04:31:33,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:33,950 INFO L402 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] [2018-11-23 04:31:33,950 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:33,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-11-23 04:31:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:33,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:33,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:34,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:34,011 INFO L87 Difference]: Start difference. First operand 608 states and 756 transitions. Second operand 6 states. [2018-11-23 04:31:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:34,058 INFO L93 Difference]: Finished difference Result 649 states and 800 transitions. [2018-11-23 04:31:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:34,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-23 04:31:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:34,059 INFO L225 Difference]: With dead ends: 649 [2018-11-23 04:31:34,059 INFO L226 Difference]: Without dead ends: 613 [2018-11-23 04:31:34,059 INFO L631 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 [2018-11-23 04:31:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-23 04:31:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 608. [2018-11-23 04:31:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-23 04:31:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 754 transitions. [2018-11-23 04:31:34,085 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 754 transitions. Word has length 71 [2018-11-23 04:31:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:34,085 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 754 transitions. [2018-11-23 04:31:34,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 754 transitions. [2018-11-23 04:31:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 04:31:34,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:34,086 INFO L402 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] [2018-11-23 04:31:34,087 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:34,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-11-23 04:31:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:34,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:34,143 INFO L87 Difference]: Start difference. First operand 608 states and 754 transitions. Second operand 11 states. [2018-11-23 04:31:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:34,217 INFO L93 Difference]: Finished difference Result 633 states and 781 transitions. [2018-11-23 04:31:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:34,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-23 04:31:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:34,218 INFO L225 Difference]: With dead ends: 633 [2018-11-23 04:31:34,218 INFO L226 Difference]: Without dead ends: 600 [2018-11-23 04:31:34,218 INFO L631 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 [2018-11-23 04:31:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-11-23 04:31:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-11-23 04:31:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 04:31:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 743 transitions. [2018-11-23 04:31:34,243 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 743 transitions. Word has length 71 [2018-11-23 04:31:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:34,244 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 743 transitions. [2018-11-23 04:31:34,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 743 transitions. [2018-11-23 04:31:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 04:31:34,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:34,245 INFO L402 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] [2018-11-23 04:31:34,245 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:34,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-11-23 04:31:34,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:34,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:34,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:31:34,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:31:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:31:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:34,291 INFO L87 Difference]: Start difference. First operand 600 states and 743 transitions. Second operand 7 states. [2018-11-23 04:31:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:34,352 INFO L93 Difference]: Finished difference Result 654 states and 804 transitions. [2018-11-23 04:31:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:31:34,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-23 04:31:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:34,354 INFO L225 Difference]: With dead ends: 654 [2018-11-23 04:31:34,354 INFO L226 Difference]: Without dead ends: 598 [2018-11-23 04:31:34,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-11-23 04:31:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 594. [2018-11-23 04:31:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-23 04:31:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 733 transitions. [2018-11-23 04:31:34,382 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 733 transitions. Word has length 77 [2018-11-23 04:31:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:34,382 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 733 transitions. [2018-11-23 04:31:34,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:31:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 733 transitions. [2018-11-23 04:31:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 04:31:34,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:34,383 INFO L402 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] [2018-11-23 04:31:34,383 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:34,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-11-23 04:31:34,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:34,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:34,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:34,470 INFO L87 Difference]: Start difference. First operand 594 states and 733 transitions. Second operand 14 states. [2018-11-23 04:31:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:34,580 INFO L93 Difference]: Finished difference Result 653 states and 795 transitions. [2018-11-23 04:31:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:34,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-23 04:31:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:34,581 INFO L225 Difference]: With dead ends: 653 [2018-11-23 04:31:34,581 INFO L226 Difference]: Without dead ends: 582 [2018-11-23 04:31:34,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:31:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-11-23 04:31:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2018-11-23 04:31:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-23 04:31:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 714 transitions. [2018-11-23 04:31:34,606 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 714 transitions. Word has length 72 [2018-11-23 04:31:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:34,606 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 714 transitions. [2018-11-23 04:31:34,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 714 transitions. [2018-11-23 04:31:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 04:31:34,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:34,607 INFO L402 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] [2018-11-23 04:31:34,607 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:34,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-11-23 04:31:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:34,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:34,701 INFO L87 Difference]: Start difference. First operand 582 states and 714 transitions. Second operand 13 states. [2018-11-23 04:31:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:34,850 INFO L93 Difference]: Finished difference Result 602 states and 735 transitions. [2018-11-23 04:31:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:34,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-23 04:31:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:34,851 INFO L225 Difference]: With dead ends: 602 [2018-11-23 04:31:34,851 INFO L226 Difference]: Without dead ends: 580 [2018-11-23 04:31:34,852 INFO L631 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 [2018-11-23 04:31:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-23 04:31:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2018-11-23 04:31:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-23 04:31:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 710 transitions. [2018-11-23 04:31:34,878 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 710 transitions. Word has length 72 [2018-11-23 04:31:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:34,879 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 710 transitions. [2018-11-23 04:31:34,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 710 transitions. [2018-11-23 04:31:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 04:31:34,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:34,880 INFO L402 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] [2018-11-23 04:31:34,880 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:34,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-11-23 04:31:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:34,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:34,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:34,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 04:31:34,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:34,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:34,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:34,943 INFO L87 Difference]: Start difference. First operand 580 states and 710 transitions. Second operand 10 states. [2018-11-23 04:31:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:35,781 INFO L93 Difference]: Finished difference Result 1144 states and 1403 transitions. [2018-11-23 04:31:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 04:31:35,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 04:31:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:35,784 INFO L225 Difference]: With dead ends: 1144 [2018-11-23 04:31:35,784 INFO L226 Difference]: Without dead ends: 999 [2018-11-23 04:31:35,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-23 04:31:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-11-23 04:31:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 918. [2018-11-23 04:31:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-11-23 04:31:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1148 transitions. [2018-11-23 04:31:35,828 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1148 transitions. Word has length 73 [2018-11-23 04:31:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1148 transitions. [2018-11-23 04:31:35,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1148 transitions. [2018-11-23 04:31:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 04:31:35,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:35,830 INFO L402 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] [2018-11-23 04:31:35,830 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:35,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-11-23 04:31:35,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:35,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:35,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:35,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:35,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:35,867 INFO L87 Difference]: Start difference. First operand 918 states and 1148 transitions. Second operand 6 states. [2018-11-23 04:31:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:36,305 INFO L93 Difference]: Finished difference Result 1147 states and 1401 transitions. [2018-11-23 04:31:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:31:36,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 04:31:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:36,306 INFO L225 Difference]: With dead ends: 1147 [2018-11-23 04:31:36,306 INFO L226 Difference]: Without dead ends: 1042 [2018-11-23 04:31:36,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:31:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-11-23 04:31:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 983. [2018-11-23 04:31:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-11-23 04:31:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1221 transitions. [2018-11-23 04:31:36,376 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1221 transitions. Word has length 73 [2018-11-23 04:31:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:36,377 INFO L480 AbstractCegarLoop]: Abstraction has 983 states and 1221 transitions. [2018-11-23 04:31:36,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1221 transitions. [2018-11-23 04:31:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 04:31:36,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:36,377 INFO L402 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] [2018-11-23 04:31:36,378 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:36,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-11-23 04:31:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:36,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:36,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:36,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:36,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:36,459 INFO L87 Difference]: Start difference. First operand 983 states and 1221 transitions. Second operand 6 states. [2018-11-23 04:31:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:36,530 INFO L93 Difference]: Finished difference Result 1343 states and 1692 transitions. [2018-11-23 04:31:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:36,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 04:31:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:36,534 INFO L225 Difference]: With dead ends: 1343 [2018-11-23 04:31:36,534 INFO L226 Difference]: Without dead ends: 969 [2018-11-23 04:31:36,535 INFO L631 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 [2018-11-23 04:31:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-23 04:31:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2018-11-23 04:31:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-23 04:31:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1199 transitions. [2018-11-23 04:31:36,593 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1199 transitions. Word has length 77 [2018-11-23 04:31:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:36,593 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1199 transitions. [2018-11-23 04:31:36,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1199 transitions. [2018-11-23 04:31:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 04:31:36,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:36,594 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 04:31:36,594 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:36,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-11-23 04:31:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:31:36,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:36,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:36,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:36,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:36,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:36,636 INFO L87 Difference]: Start difference. First operand 969 states and 1199 transitions. Second operand 5 states. [2018-11-23 04:31:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:36,705 INFO L93 Difference]: Finished difference Result 1014 states and 1247 transitions. [2018-11-23 04:31:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:36,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-23 04:31:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:36,708 INFO L225 Difference]: With dead ends: 1014 [2018-11-23 04:31:36,708 INFO L226 Difference]: Without dead ends: 969 [2018-11-23 04:31:36,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-23 04:31:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2018-11-23 04:31:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-23 04:31:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1197 transitions. [2018-11-23 04:31:36,768 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1197 transitions. Word has length 75 [2018-11-23 04:31:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:36,768 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1197 transitions. [2018-11-23 04:31:36,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1197 transitions. [2018-11-23 04:31:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 04:31:36,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:36,770 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 04:31:36,770 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:36,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-11-23 04:31:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:36,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:36,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:31:36,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:36,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:36,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:36,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:36,826 INFO L87 Difference]: Start difference. First operand 969 states and 1197 transitions. Second operand 6 states. [2018-11-23 04:31:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:36,912 INFO L93 Difference]: Finished difference Result 1010 states and 1239 transitions. [2018-11-23 04:31:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:31:36,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-23 04:31:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:36,915 INFO L225 Difference]: With dead ends: 1010 [2018-11-23 04:31:36,915 INFO L226 Difference]: Without dead ends: 969 [2018-11-23 04:31:36,915 INFO L631 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 [2018-11-23 04:31:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-23 04:31:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2018-11-23 04:31:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-23 04:31:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1195 transitions. [2018-11-23 04:31:36,974 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1195 transitions. Word has length 75 [2018-11-23 04:31:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:36,974 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1195 transitions. [2018-11-23 04:31:36,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1195 transitions. [2018-11-23 04:31:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 04:31:36,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:36,976 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 04:31:36,976 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:36,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-11-23 04:31:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:36,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:31:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:37,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:37,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:37,050 INFO L87 Difference]: Start difference. First operand 969 states and 1195 transitions. Second operand 11 states. [2018-11-23 04:31:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:37,153 INFO L93 Difference]: Finished difference Result 991 states and 1218 transitions. [2018-11-23 04:31:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:37,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 04:31:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:37,156 INFO L225 Difference]: With dead ends: 991 [2018-11-23 04:31:37,156 INFO L226 Difference]: Without dead ends: 933 [2018-11-23 04:31:37,157 INFO L631 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 [2018-11-23 04:31:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-23 04:31:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 927. [2018-11-23 04:31:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-11-23 04:31:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1143 transitions. [2018-11-23 04:31:37,205 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1143 transitions. Word has length 75 [2018-11-23 04:31:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:37,205 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1143 transitions. [2018-11-23 04:31:37,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1143 transitions. [2018-11-23 04:31:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 04:31:37,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:37,206 INFO L402 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] [2018-11-23 04:31:37,206 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:37,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-11-23 04:31:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:37,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:37,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:37,299 INFO L87 Difference]: Start difference. First operand 927 states and 1143 transitions. Second operand 14 states. [2018-11-23 04:31:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:37,437 INFO L93 Difference]: Finished difference Result 955 states and 1172 transitions. [2018-11-23 04:31:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:37,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-23 04:31:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:37,441 INFO L225 Difference]: With dead ends: 955 [2018-11-23 04:31:37,441 INFO L226 Difference]: Without dead ends: 923 [2018-11-23 04:31:37,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:31:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-23 04:31:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-23 04:31:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-23 04:31:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1135 transitions. [2018-11-23 04:31:37,495 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1135 transitions. Word has length 77 [2018-11-23 04:31:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:37,495 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1135 transitions. [2018-11-23 04:31:37,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1135 transitions. [2018-11-23 04:31:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 04:31:37,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:37,497 INFO L402 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] [2018-11-23 04:31:37,497 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:37,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-11-23 04:31:37,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:37,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:37,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:37,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:31:37,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:37,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:31:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:31:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:31:37,572 INFO L87 Difference]: Start difference. First operand 923 states and 1135 transitions. Second operand 5 states. [2018-11-23 04:31:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:37,804 INFO L93 Difference]: Finished difference Result 1283 states and 1606 transitions. [2018-11-23 04:31:37,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:31:37,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-23 04:31:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:37,806 INFO L225 Difference]: With dead ends: 1283 [2018-11-23 04:31:37,806 INFO L226 Difference]: Without dead ends: 923 [2018-11-23 04:31:37,806 INFO L631 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 [2018-11-23 04:31:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-23 04:31:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-23 04:31:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-23 04:31:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1133 transitions. [2018-11-23 04:31:37,851 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1133 transitions. Word has length 81 [2018-11-23 04:31:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:37,851 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1133 transitions. [2018-11-23 04:31:37,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:31:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1133 transitions. [2018-11-23 04:31:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:31:37,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:37,852 INFO L402 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] [2018-11-23 04:31:37,852 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:37,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-11-23 04:31:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:37,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 04:31:37,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:37,953 INFO L87 Difference]: Start difference. First operand 923 states and 1133 transitions. Second operand 10 states. [2018-11-23 04:31:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:38,854 INFO L93 Difference]: Finished difference Result 988 states and 1198 transitions. [2018-11-23 04:31:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:38,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-23 04:31:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:38,856 INFO L225 Difference]: With dead ends: 988 [2018-11-23 04:31:38,856 INFO L226 Difference]: Without dead ends: 855 [2018-11-23 04:31:38,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-23 04:31:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-23 04:31:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 429. [2018-11-23 04:31:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-23 04:31:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 525 transitions. [2018-11-23 04:31:38,884 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 525 transitions. Word has length 78 [2018-11-23 04:31:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:38,885 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 525 transitions. [2018-11-23 04:31:38,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 525 transitions. [2018-11-23 04:31:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 04:31:38,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:38,886 INFO L402 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] [2018-11-23 04:31:38,886 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:38,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-11-23 04:31:38,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:38,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:38,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:38,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:38,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:38,983 INFO L87 Difference]: Start difference. First operand 429 states and 525 transitions. Second operand 13 states. [2018-11-23 04:31:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:39,108 INFO L93 Difference]: Finished difference Result 431 states and 526 transitions. [2018-11-23 04:31:39,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:39,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-23 04:31:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:39,109 INFO L225 Difference]: With dead ends: 431 [2018-11-23 04:31:39,109 INFO L226 Difference]: Without dead ends: 367 [2018-11-23 04:31:39,110 INFO L631 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 [2018-11-23 04:31:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-23 04:31:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-23 04:31:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-23 04:31:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 457 transitions. [2018-11-23 04:31:39,134 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 457 transitions. Word has length 79 [2018-11-23 04:31:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:39,134 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 457 transitions. [2018-11-23 04:31:39,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 457 transitions. [2018-11-23 04:31:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 04:31:39,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:39,134 INFO L402 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] [2018-11-23 04:31:39,135 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:39,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-11-23 04:31:39,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:39,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:39,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:39,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:39,165 INFO L87 Difference]: Start difference. First operand 367 states and 457 transitions. Second operand 3 states. [2018-11-23 04:31:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:39,201 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2018-11-23 04:31:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:39,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-23 04:31:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:39,202 INFO L225 Difference]: With dead ends: 410 [2018-11-23 04:31:39,202 INFO L226 Difference]: Without dead ends: 372 [2018-11-23 04:31:39,203 INFO L631 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 [2018-11-23 04:31:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-23 04:31:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2018-11-23 04:31:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-23 04:31:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-11-23 04:31:39,239 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 80 [2018-11-23 04:31:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:39,239 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-11-23 04:31:39,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-11-23 04:31:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 04:31:39,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:39,240 INFO L402 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] [2018-11-23 04:31:39,240 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:39,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-11-23 04:31:39,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 04:31:39,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:39,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:31:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:31:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:31:39,347 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-11-23 04:31:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:39,455 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-11-23 04:31:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:31:39,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-23 04:31:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:39,456 INFO L225 Difference]: With dead ends: 383 [2018-11-23 04:31:39,456 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 04:31:39,456 INFO L631 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 [2018-11-23 04:31:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 04:31:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-11-23 04:31:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-23 04:31:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-11-23 04:31:39,478 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-11-23 04:31:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:39,479 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-11-23 04:31:39,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:31:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-11-23 04:31:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 04:31:39,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:39,479 INFO L402 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] [2018-11-23 04:31:39,480 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:39,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-11-23 04:31:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:39,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:39,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:39,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:31:39,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:31:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:31:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:31:39,506 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-11-23 04:31:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:39,630 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-11-23 04:31:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:31:39,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-23 04:31:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:39,631 INFO L225 Difference]: With dead ends: 445 [2018-11-23 04:31:39,631 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 04:31:39,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 04:31:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-11-23 04:31:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 04:31:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-11-23 04:31:39,651 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-11-23 04:31:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:39,651 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-11-23 04:31:39,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:31:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-11-23 04:31:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 04:31:39,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:39,652 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:39,652 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:39,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-11-23 04:31:39,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:39,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:39,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:39,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:39,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 04:31:39,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:39,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:31:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:31:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:31:39,750 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-11-23 04:31:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:40,233 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-11-23 04:31:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:31:40,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 04:31:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:40,234 INFO L225 Difference]: With dead ends: 289 [2018-11-23 04:31:40,234 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 04:31:40,235 INFO L631 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 [2018-11-23 04:31:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 04:31:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-11-23 04:31:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-23 04:31:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-11-23 04:31:40,250 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-11-23 04:31:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:40,250 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-11-23 04:31:40,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:31:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-11-23 04:31:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 04:31:40,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:40,251 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:40,251 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:40,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-11-23 04:31:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:40,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:40,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:31:40,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:31:40,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:31:40,282 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-23 04:31:40,284 INFO L202 CegarAbsIntRunner]: [21], [22], [95], [99], [102], [110], [115], [118], [132], [145], [160], [172], [176], [179], [182], [185], [191], [201], [204], [207], [234], [239], [349], [352], [355], [360], [364], [374], [377], [382], [385], [410], [413], [418], [462], [463], [464], [465], [466], [471], [474], [488], [490], [500], [504], [509], [532], [535], [540], [542], [548], [549], [551], [552], [553], [793], [796], [803], [806], [808], [812], [815], [825], [852], [855], [858], [871], [872], [885], [886], [1314], [1320], [1326], [1328], [1330], [1333], [1335], [1339], [1340], [1363], [1364], [1365], [1366], [1369], [1370], [1377], [1419], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1429], [1430], [1467], [1468], [1469], [1470], [1495], [1496], [1497], [1553], [1554], [1555], [1556] [2018-11-23 04:31:40,313 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:31:40,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:31:40,490 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:31:40,491 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Performed 556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 71 variables. [2018-11-23 04:31:40,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:40,509 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:31:40,634 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 75.08% of their original sizes. [2018-11-23 04:31:40,634 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:31:40,754 INFO L415 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-11-23 04:31:40,754 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:31:40,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:31:40,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-23 04:31:40,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:40,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:40,756 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2018-11-23 04:31:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:41,798 INFO L93 Difference]: Finished difference Result 649 states and 764 transitions. [2018-11-23 04:31:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:31:41,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-11-23 04:31:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:41,800 INFO L225 Difference]: With dead ends: 649 [2018-11-23 04:31:41,800 INFO L226 Difference]: Without dead ends: 485 [2018-11-23 04:31:41,800 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-23 04:31:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 465. [2018-11-23 04:31:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-23 04:31:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 545 transitions. [2018-11-23 04:31:41,834 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 545 transitions. Word has length 114 [2018-11-23 04:31:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:41,834 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 545 transitions. [2018-11-23 04:31:41,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 545 transitions. [2018-11-23 04:31:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 04:31:41,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:41,835 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:41,835 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:41,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-11-23 04:31:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:41,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:31:41,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:41,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 04:31:41,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:31:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:31:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:31:41,892 INFO L87 Difference]: Start difference. First operand 465 states and 545 transitions. Second operand 8 states. [2018-11-23 04:31:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:41,953 INFO L93 Difference]: Finished difference Result 483 states and 564 transitions. [2018-11-23 04:31:41,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:31:41,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-23 04:31:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:41,956 INFO L225 Difference]: With dead ends: 483 [2018-11-23 04:31:41,956 INFO L226 Difference]: Without dead ends: 349 [2018-11-23 04:31:41,957 INFO L631 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 [2018-11-23 04:31:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-23 04:31:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-11-23 04:31:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-23 04:31:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 381 transitions. [2018-11-23 04:31:41,981 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 381 transitions. Word has length 101 [2018-11-23 04:31:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:41,981 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 381 transitions. [2018-11-23 04:31:41,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:31:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 381 transitions. [2018-11-23 04:31:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 04:31:41,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:41,982 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:41,982 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:41,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2001585538, now seen corresponding path program 1 times [2018-11-23 04:31:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:41,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:41,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:41,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:41,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 04:31:42,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:31:42,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:31:42,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-23 04:31:42,048 INFO L202 CegarAbsIntRunner]: [21], [22], [95], [99], [104], [110], [115], [118], [132], [145], [160], [172], [176], [179], [182], [185], [191], [201], [204], [207], [234], [239], [349], [352], [355], [360], [364], [374], [377], [382], [385], [410], [413], [418], [462], [463], [464], [465], [466], [471], [474], [488], [490], [500], [504], [509], [532], [535], [540], [542], [548], [549], [551], [552], [553], [793], [796], [803], [806], [808], [812], [815], [825], [852], [855], [858], [871], [872], [885], [886], [1314], [1320], [1326], [1328], [1330], [1333], [1335], [1339], [1340], [1363], [1364], [1365], [1366], [1369], [1370], [1377], [1419], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1429], [1430], [1467], [1468], [1469], [1470], [1495], [1496], [1497], [1553], [1554], [1555], [1556] [2018-11-23 04:31:42,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:31:42,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:31:42,082 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:31:42,082 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Performed 552 root evaluator evaluations with a maximum evaluation depth of 3. Performed 552 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 71 variables. [2018-11-23 04:31:42,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:42,085 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:31:42,128 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 74.99% of their original sizes. [2018-11-23 04:31:42,128 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:31:42,169 INFO L415 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-11-23 04:31:42,169 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:31:42,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:31:42,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-23 04:31:42,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:42,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:31:42,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:31:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:31:42,170 INFO L87 Difference]: Start difference. First operand 335 states and 381 transitions. Second operand 10 states. [2018-11-23 04:31:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:43,196 INFO L93 Difference]: Finished difference Result 425 states and 483 transitions. [2018-11-23 04:31:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:31:43,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-11-23 04:31:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:43,197 INFO L225 Difference]: With dead ends: 425 [2018-11-23 04:31:43,197 INFO L226 Difference]: Without dead ends: 296 [2018-11-23 04:31:43,197 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:31:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-23 04:31:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 147. [2018-11-23 04:31:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 04:31:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-11-23 04:31:43,214 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 114 [2018-11-23 04:31:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:43,214 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-11-23 04:31:43,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:31:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-11-23 04:31:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 04:31:43,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:43,215 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:43,215 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:43,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-11-23 04:31:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:43,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 04:31:43,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:43,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:43,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:43,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:43,368 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-11-23 04:31:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:43,649 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-23 04:31:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:31:43,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-23 04:31:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:43,651 INFO L225 Difference]: With dead ends: 169 [2018-11-23 04:31:43,651 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 04:31:43,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 04:31:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 04:31:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-23 04:31:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 04:31:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-23 04:31:43,666 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-23 04:31:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:43,666 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-23 04:31:43,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-23 04:31:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 04:31:43,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:43,667 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:43,667 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:43,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-11-23 04:31:43,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:43,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:43,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:43,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:43,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 04:31:43,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:43,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:31:43,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:43,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:31:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:31:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:31:43,723 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-23 04:31:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:44,002 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-23 04:31:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 04:31:44,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-23 04:31:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:44,003 INFO L225 Difference]: With dead ends: 280 [2018-11-23 04:31:44,003 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 04:31:44,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:31:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 04:31:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-23 04:31:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 04:31:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-23 04:31:44,016 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-23 04:31:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:44,017 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-23 04:31:44,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:31:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-23 04:31:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 04:31:44,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:44,017 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:44,017 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:44,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-11-23 04:31:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 04:31:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:44,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:44,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:44,037 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-23 04:31:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:44,067 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-23 04:31:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:44,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-23 04:31:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:44,069 INFO L225 Difference]: With dead ends: 192 [2018-11-23 04:31:44,069 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 04:31:44,070 INFO L631 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 [2018-11-23 04:31:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 04:31:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-23 04:31:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 04:31:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-23 04:31:44,083 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-23 04:31:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:44,083 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-23 04:31:44,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-23 04:31:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 04:31:44,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:44,084 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:44,084 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:44,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1306094136, now seen corresponding path program 1 times [2018-11-23 04:31:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 04:31:44,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:44,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:31:44,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:44,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:31:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:31:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:31:44,103 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 3 states. [2018-11-23 04:31:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:44,128 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-11-23 04:31:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:31:44,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-23 04:31:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:44,129 INFO L225 Difference]: With dead ends: 191 [2018-11-23 04:31:44,129 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 04:31:44,129 INFO L631 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 [2018-11-23 04:31:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 04:31:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-23 04:31:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 04:31:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-11-23 04:31:44,143 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 116 [2018-11-23 04:31:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:44,143 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-11-23 04:31:44,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:31:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-11-23 04:31:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 04:31:44,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:31:44,144 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:31:44,144 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:31:44,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:31:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-11-23 04:31:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:31:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:31:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:31:44,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:31:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:31:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 04:31:44,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:31:44,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:31:44,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:31:44,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:31:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:31:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:31:44,219 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 11 states. [2018-11-23 04:31:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:31:44,485 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-23 04:31:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:31:44,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-23 04:31:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:31:44,486 INFO L225 Difference]: With dead ends: 152 [2018-11-23 04:31:44,486 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:31:44,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:31:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:31:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:31:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:31:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:31:44,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-23 04:31:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:31:44,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:31:44,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:31:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:31:44,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:31:44,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:31:44,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:44,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:45,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:31:46,856 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 1 [2018-11-23 04:31:47,176 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2018-11-23 04:31:47,625 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 90 [2018-11-23 04:31:47,922 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 95 [2018-11-23 04:31:48,585 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 88 [2018-11-23 04:31:49,313 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 122 [2018-11-23 04:31:49,563 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 56 [2018-11-23 04:31:50,211 WARN L180 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 114 [2018-11-23 04:31:50,453 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 87 [2018-11-23 04:31:50,808 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2018-11-23 04:31:51,102 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 94 [2018-11-23 04:31:51,983 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 131 [2018-11-23 04:31:52,474 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-11-23 04:31:52,695 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-23 04:31:53,220 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 122 [2018-11-23 04:31:54,312 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 242 DAG size of output: 134 [2018-11-23 04:31:54,607 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 97 [2018-11-23 04:31:55,174 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 118 [2018-11-23 04:31:55,360 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2018-11-23 04:31:55,597 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2018-11-23 04:31:55,951 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-11-23 04:31:56,076 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-11-23 04:31:56,626 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-11-23 04:31:56,943 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 93 [2018-11-23 04:31:57,472 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 122 [2018-11-23 04:31:58,112 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-23 04:31:58,344 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2018-11-23 04:31:58,454 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-23 04:31:59,283 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2018-11-23 04:31:59,709 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2018-11-23 04:31:59,980 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2018-11-23 04:32:00,346 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-11-23 04:32:00,780 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 102 [2018-11-23 04:32:01,054 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 1 [2018-11-23 04:32:01,480 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2018-11-23 04:32:01,592 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 1 [2018-11-23 04:32:02,068 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 88 [2018-11-23 04:32:02,257 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2018-11-23 04:32:03,199 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 122 [2018-11-23 04:32:04,357 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 242 DAG size of output: 134 [2018-11-23 04:32:05,103 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 94 [2018-11-23 04:32:05,243 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2018-11-23 04:32:05,375 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2018-11-23 04:32:05,485 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 52 [2018-11-23 04:32:06,001 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 94 [2018-11-23 04:32:06,218 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-11-23 04:32:06,468 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2018-11-23 04:32:06,878 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-23 04:32:07,254 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2018-11-23 04:32:07,780 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 106 [2018-11-23 04:32:07,892 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 1 [2018-11-23 04:32:08,065 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2018-11-23 04:32:08,857 WARN L180 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 131 [2018-11-23 04:32:09,280 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 79 [2018-11-23 04:32:09,713 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 117 [2018-11-23 04:32:09,912 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2018-11-23 04:32:10,349 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2018-11-23 04:32:10,672 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 78 [2018-11-23 04:32:11,232 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2018-11-23 04:32:11,512 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 94 [2018-11-23 04:32:11,624 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-23 04:32:12,612 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2018-11-23 04:32:13,080 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-23 04:32:13,445 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 81 [2018-11-23 04:32:14,008 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 102 [2018-11-23 04:32:14,116 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-11-23 04:32:14,288 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (let ((.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (or .cse5 .cse6 .cse7 .cse8 (< ~compRegistered~0 1) (not (= 1 ~routine~0))))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3) (let ((.cse4 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse4) (< .cse4 0) .cse2 .cse3)))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0))) (or .cse0 (or .cse5 .cse6 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse7 .cse8 .cse3 (< ~IPC~0 (+ ~DC~0 5))))) [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (+ ~myStatus~0 1073741637)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0)))) (let ((.cse13 (not (= 1 ~NP~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~UNLOADED~0 0))) (.cse9 (not (= 7 ~IPC~0))) (.cse6 (= |old(~s~0)| ~s~0)) (.cse14 (let ((.cse18 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse19 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))))) (and (or .cse0 .cse18 (not (= ~myStatus~0 0)) .cse19 .cse5) (or .cse0 .cse18 (< 0 .cse15) (< .cse15 0) .cse19 .cse5)))) (.cse16 (not (= 5 ~MPR1~0))) (.cse17 (not (= ~KernelMode~0 0))) (.cse10 (not (= ~DeviceUsageTypePaging~0 1))) (.cse11 (not (= 6 ~MPR3~0))) (.cse12 (not (= ~Executive~0 0)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~customIrp~0 0) .cse14 (not (= 0 .cse15)) .cse16 .cse17 (not (= |old(~customIrp~0)| 0))) (or .cse13 .cse7 .cse8 .cse9 .cse6 .cse14 .cse16 .cse17 .cse10 .cse11 .cse12)))) [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-23 04:32:14,289 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= ~Executive~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= ~KernelMode~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 .cse1 .cse2 .cse3 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse4 .cse5 .cse6)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) .cse6))) [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse8 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse0 (<= .cse8 0))) (and (or (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse0) (or .cse1 .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5 .cse6 .cse7)) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)) .cse7 (and (= |old(~s~0)| ~s~0) (or (< 0 .cse8) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse0 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)))))) [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse7) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse7 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse10 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 .cse10 (not (= |old(~customIrp~0)| 0))) (or .cse6 .cse0 .cse1 .cse2 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse8 .cse9 .cse10 .cse3 .cse4 .cse5)))) [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-23 04:32:14,290 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= 6 ~MPR3~0))) (.cse9 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse10) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse10 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse7 .cse8 .cse9) (or (= ~customIrp~0 0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse0 (not (= 0 .cse10)) .cse4 .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse7) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse7 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse10 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 .cse10 (= ~customIrp~0 0) (not (= |old(~customIrp~0)| 0))) (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse6 .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5)))) [2018-11-23 04:32:14,291 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= 6 ~MPR3~0))) (.cse9 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse10) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse10 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse7 .cse8 .cse9) (or (= ~customIrp~0 0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse0 (not (= 0 .cse10)) .cse4 .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-23 04:32:14,291 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse7) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse7 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse10 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 (= ~customIrp~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 .cse10 (not (= |old(~customIrp~0)| 0))) (or .cse6 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5)))) [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse18 (not (= |old(~compRegistered~0)| 0))) (.cse19 (not (= 0 |old(~pended~0)|)))) (and (or .cse11 .cse12 (< 0 .cse7) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse7 0) .cse18 .cse19) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse10 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 (= ~customIrp~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 .cse10 (not (= |old(~customIrp~0)| 0))) (or .cse6 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5)))) [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (and (= ~customIrp~0 0) (= ~UNLOADED~0 0) (= ~MPR1~0 5) (= ~IPC~0 7) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~routine~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~myStatus~0)) (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 .cse6) .cse5 (<= .cse6 0))))) (= ~Executive~0 0) (= ~DC~0 2) (= ~MPR3~0 6) (= ~NP~0 1) (= ~DeviceUsageTypePaging~0 1) (= ~KernelMode~0 0) (= ~SKIP2~0 4)) (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,292 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-23 04:32:14,292 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 .cse8 .cse5 .cse7)))) [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~Executive~0 0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~DeviceUsageTypePaging~0 1) (= ~KernelMode~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,292 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-23 04:32:14,292 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,292 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 .cse8 .cse5 .cse7)))) [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse2 (= ~lowerDriverReturn~0 main_~status~9)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (and (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse3 .cse4 (and .cse1 .cse2)) (and (and .cse3 .cse4 .cse1) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (not (= 259 main_~status~9)) (and (<= ~s~0 ~DC~0) (<= (+ ~DC~0 5) ~IPC~0) .cse0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 04:32:14,293 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L444 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))))) [2018-11-23 04:32:14,293 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse0 (= 0 main_~status~9)) (.cse3 (= ~IPC~0 ~s~0)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse4 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse5 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse7 .cse1 .cse2 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse5 .cse6 .cse4 .cse7 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse6 (and .cse5 .cse7 .cse2))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)))) [2018-11-23 04:32:14,293 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-23 04:32:14,293 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= 0 main_~status~9)) (.cse1 (and .cse7 (= 0 ~pended~0))) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse9 (= ~IPC~0 ~s~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (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)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse5 .cse2 .cse6 .cse3) (and .cse4 .cse7 (= ~routine~0 0) .cse8 .cse5 .cse6 .cse3 (<= 1 ~compRegistered~0) .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (and .cse4 .cse1 .cse6) (<= (+ ~DC~0 5) ~IPC~0) .cse5)) (not (= 0 |old(~pended~0)|)) (and .cse4 .cse1 .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse0 .cse1 .cse3 .cse9) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (let ((.cse0 (= ~UNLOADED~0 0)) (.cse2 (= ~MPR1~0 5)) (.cse3 (= ~IPC~0 7)) (.cse7 (let ((.cse12 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (= 0 ~pended~0)) (.cse14 (= ~s~0 ~NP~0)) (.cse15 (= 0 ~compRegistered~0)) (.cse16 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse17 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse18 (= ~routine~0 0)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ~myStatus~0)) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 0 .cse6) .cse18 .cse19 (<= .cse6 0))))) (.cse8 (= ~Executive~0 0)) (.cse10 (= ~DC~0 2)) (.cse11 (= ~MPR3~0 6)) (.cse1 (= ~NP~0 1)) (.cse4 (= ~DeviceUsageTypePaging~0 1)) (.cse5 (= ~KernelMode~0 0)) (.cse9 (= ~SKIP2~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~customIrp~0 0) .cse0 .cse2 .cse3 .cse7 .cse8 .cse10 .cse11 .cse1 .cse4 .cse5 .cse9)))) (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L444 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (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)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L444 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-23 04:32:14,294 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-23 04:32:14,295 INFO L444 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 04:32:14,295 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 ~pended~0))) (.cse9 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) [2018-11-23 04:32:14,295 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-23 04:32:14,295 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 ~pended~0))) (.cse9 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (= |old(~s~0)| ~s~0)) [2018-11-23 04:32:14,295 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-23 04:32:14,295 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-23 04:32:14,295 INFO L444 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-11-23 04:32:14,295 INFO L444 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,295 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L444 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-23 04:32:14,296 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L444 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-23 04:32:14,297 INFO L444 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,297 INFO L444 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L444 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-23 04:32:14,298 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse33 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse33)) (.cse7 (< .cse33 0)) (.cse26 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse27 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~myStatus~0 0))) (.cse8 (not (= 0 ~pended~0))) (.cse28 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse29 (< ~MPR3~0 (+ ~NP~0 5)))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (< ~compRegistered~0 1)) (.cse5 (not (= 1 ~routine~0))) (.cse1 (= |old(~s~0)| ~s~0)) (.cse0 (= ~customIrp~0 0)) (.cse11 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse12 (not (= 2 ~DC~0))) (.cse13 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse14 (not (= ~UNLOADED~0 0))) (.cse15 (not (= 7 ~IPC~0))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse18 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse19 (not (= ~Executive~0 0))) (.cse20 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse21 (not (= 1 ~NP~0))) (.cse30 (let ((.cse31 (or .cse29 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse32 (not (= 0 ~routine~0)))) (and (or .cse26 .cse3 .cse28 .cse31 .cse32 .cse6 .cse27 .cse7 .cse8) (or .cse26 .cse31 .cse32 .cse6 .cse27 .cse10 .cse8 .cse28)))) (.cse22 (not (= 5 ~MPR1~0))) (.cse23 (not (= ~KernelMode~0 0))) (.cse24 (not (= |old(~customIrp~0)| 0)))) (and (or (and .cse0 (and .cse1 (= 1 ~setEventCalled~0))) (or (let ((.cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse4 .cse5 .cse6 .cse8 .cse9))) .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~SKIP2~0 4)) .cse16 .cse17 .cse18 .cse19 .cse20 (not (= 1 |old(~s~0)|)) .cse21 .cse22 .cse23 .cse24)) (or .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23 (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse25 (or .cse2 .cse26 .cse6 .cse27 .cse28 (or .cse29 .cse8 .cse9 .cse5)))) (and (or .cse3 .cse7 .cse25) (or .cse10 .cse25))) .cse24) (or .cse1 .cse30) (or .cse0 (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24)))))) [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-23 04:32:14,299 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-23 04:32:14,300 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse33 (+ ~myStatus~0 1073741637))) (let ((.cse17 (< 0 .cse33)) (.cse21 (< .cse33 0)) (.cse27 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse20 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse28 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse24 (not (= ~myStatus~0 0))) (.cse22 (not (= 0 ~pended~0))) (.cse29 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse30 (< ~MPR3~0 (+ ~NP~0 5)))) (let ((.cse0 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse2 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse7 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse9 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse11 (let ((.cse31 (or .cse30 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse32 (not (= 0 ~routine~0)))) (and (or .cse27 .cse17 .cse29 .cse31 .cse32 .cse20 .cse28 .cse21 .cse22) (or .cse27 .cse31 .cse32 .cse20 .cse28 .cse24 .cse22 .cse29)))) (.cse1 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse5 (not (= ~DeviceUsageTypePaging~0 1))) (.cse6 (not (= 6 ~MPR3~0))) (.cse8 (not (= ~Executive~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse12 (not (= 5 ~MPR1~0))) (.cse13 (not (= ~KernelMode~0 0))) (.cse16 (not (= |old(~setEventCalled~0)| 1))) (.cse23 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse14 (not (= |old(~customIrp~0)| 0))) (.cse15 (= ~customIrp~0 0)) (.cse25 (= ~s~0 ~NP~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (or (and .cse15 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0))) (or (let ((.cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse16 .cse24 .cse18 .cse19 .cse20 .cse22 .cse23))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP2~0 4)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 1 |old(~s~0)|)) .cse10 .cse12 .cse13 .cse14)) (or .cse25 .cse11) (or (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse12 .cse13 (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse26 (or .cse16 .cse27 .cse20 .cse28 .cse29 (or .cse30 .cse22 .cse23 .cse19)))) (and (or .cse17 .cse21 .cse26) (or .cse24 .cse26))) .cse14) (and .cse15 .cse25)))))) [2018-11-23 04:32:14,300 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-23 04:32:14,300 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse33 (+ ~myStatus~0 1073741637))) (let ((.cse17 (< 0 .cse33)) (.cse21 (< .cse33 0)) (.cse27 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse20 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse28 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse24 (not (= ~myStatus~0 0))) (.cse22 (not (= 0 ~pended~0))) (.cse29 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse30 (< ~MPR3~0 (+ ~NP~0 5)))) (let ((.cse0 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse2 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse7 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse9 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse11 (let ((.cse31 (or .cse30 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse32 (not (= 0 ~routine~0)))) (and (or .cse27 .cse17 .cse29 .cse31 .cse32 .cse20 .cse28 .cse21 .cse22) (or .cse27 .cse31 .cse32 .cse20 .cse28 .cse24 .cse22 .cse29)))) (.cse1 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse5 (not (= ~DeviceUsageTypePaging~0 1))) (.cse6 (not (= 6 ~MPR3~0))) (.cse8 (not (= ~Executive~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse12 (not (= 5 ~MPR1~0))) (.cse13 (not (= ~KernelMode~0 0))) (.cse16 (not (= |old(~setEventCalled~0)| 1))) (.cse23 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse14 (not (= |old(~customIrp~0)| 0))) (.cse15 (= ~customIrp~0 0)) (.cse25 (= ~s~0 ~NP~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (or (and .cse15 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0))) (or (let ((.cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse16 .cse24 .cse18 .cse19 .cse20 .cse22 .cse23))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP2~0 4)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 1 |old(~s~0)|)) .cse10 .cse12 .cse13 .cse14)) (or .cse25 .cse11) (or (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse12 .cse13 (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse26 (or .cse16 .cse27 .cse20 .cse28 .cse29 (or .cse30 .cse22 .cse23 .cse19)))) (and (or .cse17 .cse21 .cse26) (or .cse24 .cse26))) .cse14) (and .cse15 .cse25)))))) [2018-11-23 04:32:14,301 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse26 (+ ~myStatus~0 1073741637)) (.cse25 (< ~MPR3~0 (+ ~NP~0 5)))) (let ((.cse1 (or .cse25 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse2 (not (= 0 ~routine~0))) (.cse14 (not (= 2 ~DC~0))) (.cse15 (not (= ~UNLOADED~0 0))) (.cse16 (not (= 7 ~IPC~0))) (.cse17 (not (= ~DeviceUsageTypePaging~0 1))) (.cse18 (not (= 6 ~MPR3~0))) (.cse19 (not (= ~Executive~0 0))) (.cse20 (not (= 1 ~NP~0))) (.cse21 (not (= 5 ~MPR1~0))) (.cse22 (not (= ~KernelMode~0 0))) (.cse9 (< 0 .cse26)) (.cse12 (< .cse26 0)) (.cse5 (not (= ~myStatus~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~pended~0))) (.cse13 (< ~compRegistered~0 1)) (.cse11 (not (= 1 ~routine~0))) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse3 .cse12 .cse6 .cse13) (or .cse8 .cse5 .cse10 .cse11 .cse3 .cse6 .cse13))) (not (= |KeWaitForSingleObject_#in~WaitMode| 0)) .cse14 (not (= |KeWaitForSingleObject_#in~WaitReason| 0)) .cse15 .cse16 (not (= ~SKIP2~0 4)) .cse17 .cse18 (not (= |KeWaitForSingleObject_#in~Timeout| 0)) .cse19 (not (= |KeWaitForSingleObject_#in~Alertable| 0)) (not (= 1 |old(~s~0)|)) .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse24 (or .cse8 .cse0 .cse3 .cse4 .cse7 (or .cse25 .cse6 .cse13 .cse11)))) (and (or .cse9 .cse12 .cse24) (or .cse5 .cse24))) .cse23)))) [2018-11-23 04:32:14,301 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-23 04:32:14,301 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-23 04:32:14,301 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-23 04:32:14,301 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-23 04:32:14,301 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-23 04:32:14,302 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse26 (= ~customIrp~0 0)) (.cse1 (= |old(~s~0)| ~s~0)) (.cse12 (< 0 .cse34)) (.cse13 (< .cse34 0)) (.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse18 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse19 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse15 (not (= ~myStatus~0 0))) (.cse22 (not (= 0 ~pended~0))) (.cse20 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse21 (< ~MPR3~0 (+ ~NP~0 5)))) (let ((.cse0 (let ((.cse32 (or .cse21 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) (.cse33 (not (= 0 ~routine~0)))) (and (or .cse17 .cse12 .cse20 .cse32 .cse33 .cse18 .cse19 .cse13 .cse22) (or .cse17 .cse32 .cse33 .cse18 .cse19 .cse15 .cse22 .cse20)))) (.cse16 (not (= |old(~setEventCalled~0)| 1))) (.cse24 (not (= 1 ~routine~0))) (.cse23 (< ~compRegistered~0 1)) (.cse27 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse3 (not (= 2 ~DC~0))) (.cse28 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse5 (not (= 7 ~IPC~0))) (.cse6 (not (= ~DeviceUsageTypePaging~0 1))) (.cse7 (not (= 6 ~MPR3~0))) (.cse29 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse8 (not (= ~Executive~0 0))) (.cse30 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse9 (not (= 1 ~NP~0))) (.cse2 (and .cse26 (and .cse1 (= 1 ~setEventCalled~0)))) (.cse10 (not (= 5 ~MPR1~0))) (.cse11 (not (= ~KernelMode~0 0))) (.cse25 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse14 (or .cse16 .cse17 .cse18 .cse19 .cse20 (or .cse21 .cse22 .cse23 .cse24)))) (and (or .cse12 .cse13 .cse14) (or .cse15 .cse14))) .cse25)) (or .cse26 (or .cse27 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse30 .cse9 .cse0 .cse10 .cse11 .cse25)) (or (let ((.cse31 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse16 .cse12 .cse31 .cse24 .cse18 .cse13 .cse22 .cse23) (or .cse16 .cse15 .cse31 .cse24 .cse18 .cse22 .cse23))) .cse27 .cse3 .cse28 .cse4 .cse5 (not (= ~SKIP2~0 4)) .cse6 .cse7 .cse29 .cse8 .cse30 (not (= 1 |old(~s~0)|)) .cse9 .cse2 .cse10 .cse11 .cse25))))) [2018-11-23 04:32:14,302 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse13 ~SKIP2~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 04:32:14,302 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-23 04:32:14,302 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-11-23 04:32:14,302 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-23 04:32:14,302 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,303 INFO L444 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L444 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-23 04:32:14,303 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-23 04:32:14,308 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (= ~s~0 |old(~s~0)|)) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-11-23 04:32:14,308 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-23 04:32:14,308 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-11-23 04:32:14,308 INFO L444 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,308 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-23 04:32:14,308 INFO L444 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,308 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-23 04:32:14,309 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-23 04:32:14,309 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-23 04:32:14,309 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-23 04:32:14,309 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-23 04:32:14,309 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-23 04:32:14,309 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (= 0 ~pended~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse10) .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-11-23 04:32:14,316 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-23 04:32:14,316 INFO L444 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~compRegistered~0 1))) [2018-11-23 04:32:14,316 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-23 04:32:14,316 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse9) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-23 04:32:14,316 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-23 04:32:14,316 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-23 04:32:14,316 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-23 04:32:14,317 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (let ((.cse0 (not (= ~myStatus~0 0)))) (let ((.cse1 (let ((.cse6 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= 2 ~DC~0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse5 (not (= 7 ~IPC~0))) (.cse10 (not (= ~DeviceUsageTypePaging~0 1))) (.cse11 (not (= 6 ~MPR3~0))) (.cse12 (not (= ~Executive~0 0))) (.cse2 (not (= 1 ~NP~0))) (.cse7 (not (= 5 ~MPR1~0))) (.cse8 (let ((.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (not (= 0 ~routine~0))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse18 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse19 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse20 (not (= |old(~compRegistered~0)| 0))) (.cse21 (not (= 0 |old(~pended~0)|)))) (and (or .cse13 .cse14 (< 0 .cse6) .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse6 0) .cse20 .cse21) (or .cse13 .cse14 .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse9 (not (= ~KernelMode~0 0)))) (and (or .cse2 .cse3 .cse4 .cse5 (not (= 0 .cse6)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse2 .cse7 .cse8 .cse9 (not (= |old(~customIrp~0)| 0)))))))) (and (or .cse0 .cse1 (= ~customIrp~0 0)) (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) .cse1)))) [2018-11-23 04:32:14,319 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-23 04:32:14,319 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-23 04:32:14,320 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,320 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-23 04:32:14,320 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (let ((.cse15 (+ |old(~myStatus~0)| 1073741637)) (.cse6 (= ~UNLOADED~0 0)) (.cse7 (= ~DeviceUsageTypePaging~0 1)) (.cse22 (= ~KernelMode~0 0)) (.cse8 (= ~Executive~0 0)) (.cse4 (= 0 ~myStatus~0)) (.cse18 (+ ~SKIP2~0 3)) (.cse21 (+ ~NP~0 2)) (.cse20 (+ ~DC~0 2)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse3 (and .cse6 (= ~MPR1~0 5) (= ~IPC~0 7) .cse7 .cse22 .cse8 (= ~DC~0 2) (and (not (= ~MPR3~0 |old(~s~0)|)) (= ~customIrp~0 0) (let ((.cse23 (and (<= .cse21 ~SKIP1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= .cse20 ~SKIP2~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (.cse24 (<= .cse18 ~IPC~0))) (or (and .cse23 .cse24 .cse4) (let ((.cse25 (+ ~myStatus~0 1073741637))) (and .cse23 .cse24 (<= .cse25 0) (<= 0 .cse25))))) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (= ~s~0 1)) (= ~MPR3~0 6))) (.cse5 (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (.cse1 (< 0 .cse15))) (let ((.cse0 (or (not (= 2 ~DC~0)) (not .cse6) (not (= 7 ~IPC~0)) (not .cse7) (not (= 6 ~MPR3~0)) (not .cse8) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse9 (< ~SKIP1~0 .cse21)) (.cse10 (< ~SKIP2~0 .cse20)) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 .cse19)) (.cse14 (< ~IPC~0 .cse18)) (.cse16 (not (= |old(~compRegistered~0)| 0))) (.cse17 (not (= 0 |old(~pended~0)|)))) (and (or .cse9 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 (< .cse15 0) .cse16 .cse17) (or .cse9 (not (= |old(~myStatus~0)| 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) (not .cse22) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and .cse3 (= |old(~myStatus~0)| ~myStatus~0) (<= (+ CdAudioPnp_~status~2 1) 0) .cse5))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5) .cse0 .cse2))))) [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-23 04:32:14,324 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-23 04:32:14,332 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= ~customIrp~0 0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-23 04:32:14,332 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= |old(~s~0)| ~s~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 04:32:14,333 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-23 04:32:14,333 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-23 04:32:14,333 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-23 04:32:14,333 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-23 04:32:14,333 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse10 (+ ~SKIP2~0 3)) (.cse12 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 2)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= .cse10 ~IPC~0) (<= .cse12 ~SKIP2~0) (and (<= .cse13 ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse11 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1))))) (or (and (= 0 CdAudioPnp_~status~2) .cse0) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse3 (< ~SKIP2~0 .cse12)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse11)) (.cse7 (< ~IPC~0 .cse10)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))))) [2018-11-23 04:32:14,336 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-23 04:32:14,336 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-23 04:32:14,336 INFO L444 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-23 04:32:14,336 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= |old(~s~0)| ~s~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 04:32:14,336 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= 1 ~setEventCalled~0) (= ~myStatus~0 |old(~myStatus~0)|))) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-23 04:32:14,343 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L444 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse1 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse1 0) .cse7 .cse8)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,344 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-23 04:32:14,344 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,352 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,352 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,352 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-23 04:32:14,352 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,352 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L444 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,361 INFO L444 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-23 04:32:14,361 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-23 04:32:14,361 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-23 04:32:14,362 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,376 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (<= .cse0 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-23 04:32:14,377 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,391 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-23 04:32:14,391 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse10) (<= .cse10 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))))) [2018-11-23 04:32:14,392 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-23 04:32:14,392 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-23 04:32:14,392 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,392 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-23 04:32:14,392 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-23 04:32:14,392 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-23 04:32:14,392 INFO L444 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= .cse10 0) (and (and (<= 0 .cse10) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (= |old(~myStatus~0)| ~myStatus~0))))) [2018-11-23 04:32:14,392 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-23 04:32:14,395 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-23 04:32:14,396 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse0) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 04:32:14,396 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-23 04:32:14,396 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-23 04:32:14,397 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-23 04:32:14,397 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-23 04:32:14,398 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,398 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-23 04:32:14,398 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,398 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-23 04:32:14,398 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-23 04:32:14,400 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,400 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-23 04:32:14,400 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-23 04:32:14,400 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-23 04:32:14,400 INFO L444 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse0 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-23 04:32:14,401 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= 1 ~setEventCalled~0) (<= 0 .cse19) (= ~MPR1~0 ~s~0) (<= .cse19 0))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse3 .cse14 .cse4 .cse20 .cse7 .cse8 .cse11 .cse17) (or .cse12 .cse14 .cse4 .cse20 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-23 04:32:14,407 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= 1 ~setEventCalled~0) (<= 0 .cse19) (= ~MPR1~0 ~s~0) (<= .cse19 0))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse3 .cse14 .cse4 .cse20 .cse7 .cse8 .cse11 .cse17) (or .cse12 .cse14 .cse4 .cse20 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-23 04:32:14,407 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-23 04:32:14,407 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-23 04:32:14,407 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-23 04:32:14,417 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-23 04:32:14,417 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-23 04:32:14,417 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< 0 .cse19)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (and .cse0 (= |old(~s~0)| ~s~0))) (.cse6 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse19 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse6 .cse15 .cse7 .cse8 .cse16 .cse11 .cse17) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) .cse16 (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse3 .cse14 .cse4 .cse18 .cse7 .cse8 .cse11 .cse17) (or .cse12 .cse14 .cse4 .cse18 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse16 .cse6 .cse15 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-23 04:32:14,417 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-23 04:32:14,417 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-23 04:32:14,418 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-23 04:32:14,418 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-23 04:32:14,418 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= 1 ~setEventCalled~0) (<= 0 .cse19) (= ~MPR1~0 ~s~0) (<= .cse19 0))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse3 .cse14 .cse4 .cse20 .cse7 .cse8 .cse11 .cse17) (or .cse12 .cse14 .cse4 .cse20 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-23 04:32:14,429 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-23 04:32:14,429 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-23 04:32:14,429 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-23 04:32:14,429 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-23 04:32:14,430 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< 0 .cse17)) (.cse9 (< .cse17 0)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~SKIP1~0 |old(~s~0)|)) (.cse15 (< |old(~s~0)| ~SKIP1~0)) (.cse16 (not (= ~compRegistered~0 0))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse0 (not (= ~myStatus~0 0))) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (< ~compRegistered~0 1))) (and (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse3 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse10 .cse8 .cse1 .cse2 .cse11 .cse12 .cse4 .cse5 .cse9 .cse6 .cse7) (or .cse13 .cse10 .cse8 .cse2 .cse14 .cse11 .cse4 .cse5 .cse9 .cse15 .cse16 .cse6) (or .cse13 .cse10 .cse0 .cse2 .cse14 .cse11 .cse4 .cse5 .cse15 .cse16 .cse6) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7)))) [2018-11-23 04:32:14,430 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-23 04:32:14,430 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< 0 .cse18)) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< .cse18 0)) (.cse7 (< ~compRegistered~0 1)) (.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse0 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse11 (not (= 0 ~routine~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0))) (.cse6 (not (= 0 |old(~pended~0)|)))) (and (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse3 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse12 .cse4 .cse5 .cse13 .cse6 .cse7) (or .cse14 .cse10 .cse8 .cse2 .cse15 .cse11 .cse4 .cse5 .cse9 .cse16 .cse17 .cse6) (or .cse10 .cse8 .cse1 .cse2 .cse13 .cse11 .cse12 .cse4 .cse5 .cse9 .cse6 .cse7) (or .cse14 .cse10 .cse0 .cse2 .cse15 .cse11 .cse4 .cse5 .cse16 .cse17 .cse6)))) [2018-11-23 04:32:14,441 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-23 04:32:14,442 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= 1 ~setEventCalled~0) (<= 0 .cse19) (= ~MPR1~0 ~s~0) (<= .cse19 0))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse3 .cse14 .cse4 .cse20 .cse7 .cse8 .cse11 .cse17) (or .cse12 .cse14 .cse4 .cse20 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-23 04:32:14,442 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse19)) (.cse8 (< .cse19 0)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse15 0) (= 0 ~pended~0) (<= 0 .cse15) (= 1 ~setEventCalled~0) (<= 0 .cse16) (= |old(~s~0)| ~s~0) (<= .cse16 0))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse17 .cse2 .cse3 .cse18 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) (or .cse11 .cse0 .cse17 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2018-11-23 04:32:14,448 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse17)) (.cse8 (< .cse17 0)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse16 (not (= 1 ~routine~0)))) (and (or .cse15 .cse2 .cse3 .cse16 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0)) (not (= 1 |old(~s~0)|)) (not (= 1 ~NP~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) (or .cse11 .cse0 .cse15 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2018-11-23 04:32:14,448 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-23 04:32:14,448 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-23 04:32:14,448 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-23 04:32:14,448 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 04:32:14,448 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L444 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (and (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-23 04:32:14,457 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-23 04:32:14,458 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-23 04:32:14,458 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,458 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-23 04:32:14,463 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-23 04:32:14,463 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-23 04:32:14,463 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,463 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-23 04:32:14,463 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-23 04:32:14,463 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,463 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,463 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-23 04:32:14,463 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-23 04:32:14,464 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-23 04:32:14,464 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-23 04:32:14,464 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-23 04:32:14,464 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-23 04:32:14,464 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse14 (+ ~NP~0 5))) (let ((.cse0 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse2 (= ~IPC~0 ~s~0)) (.cse3 (and (= 0 ~pended~0) (<= .cse14 ~MPR3~0))) (.cse1 (= ~routine~0 0))) (or (and .cse0 .cse1 (<= 1 ~compRegistered~0) .cse2) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse3 .cse1 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 .cse14)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse6 (+ |old(~myStatus~0)| 1073741637))) (or .cse4 .cse5 (< 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse6 0) .cse12 .cse13)) (or .cse4 .cse5 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) (and .cse3 .cse0 .cse1 .cse2) (and (not (= 259 CdAudioDeviceControl_~status~3)) (and (= ~DC~0 ~s~0) (and .cse3 .cse1)))))) [2018-11-23 04:32:14,468 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,468 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-23 04:32:14,468 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-23 04:32:14,468 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,468 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-23 04:32:14,468 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-23 04:32:14,468 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,481 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-23 04:32:14,481 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,481 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,481 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-23 04:32:14,481 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-23 04:32:14,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:32:14,481 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~DC~0 ~s~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0)) [2018-11-23 04:32:14,481 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:32:14,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:32:14,481 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,490 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-23 04:32:14,490 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,490 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-23 04:32:14,491 INFO L444 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,491 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-23 04:32:14,491 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-23 04:32:14,491 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse10 0) (<= 0 .cse10) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,502 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-23 04:32:14,502 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-23 04:32:14,510 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-23 04:32:14,510 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0)))) (or (and .cse0 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse2 (< ~MPR3~0 .cse12)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 CdAudio435DeviceControl_~status~6) .cse0)))) [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-23 04:32:14,511 INFO L444 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,521 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-23 04:32:14,521 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-23 04:32:14,522 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-23 04:32:14,522 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,522 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse12 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 2)) (.cse13 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse12 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0))))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (let ((.cse1 (< ~SKIP1~0 .cse14)) (.cse2 (< ~MPR3~0 .cse13)) (.cse4 (< ~SKIP2~0 .cse12)) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0)))) [2018-11-23 04:32:14,522 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-23 04:32:14,522 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-23 04:32:14,536 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,536 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-23 04:32:14,536 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-11-23 04:32:14,536 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,548 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-23 04:32:14,548 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-23 04:32:14,548 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,548 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-23 04:32:14,548 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-23 04:32:14,549 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-23 04:32:14,549 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-23 04:32:14,549 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,549 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-23 04:32:14,549 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,561 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,562 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-23 04:32:14,562 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-23 04:32:14,566 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-23 04:32:14,566 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-23 04:32:14,566 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,566 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-23 04:32:14,566 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-23 04:32:14,566 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,566 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-23 04:32:14,567 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,567 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-23 04:32:14,573 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-23 04:32:14,574 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (and (let ((.cse0 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (.cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse2 (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (and .cse0 .cse1 .cse2 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) .cse1 .cse2))) (= ~myStatus~0 |old(~myStatus~0)|))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (not (= 0 ~routine~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= ~compRegistered~0 0))) (.cse12 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse5 (+ |old(~myStatus~0)| 1073741637))) (or .cse3 .cse4 (< 0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse5 0) .cse11 .cse12)) (or .cse3 .cse4 (not (= |old(~myStatus~0)| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-23 04:32:14,581 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-23 04:32:14,582 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-23 04:32:14,582 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-23 04:32:14,586 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-23 04:32:14,594 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 04:32:14,595 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-23 04:32:14,595 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-23 04:32:14,595 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-23 04:32:14,595 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-23 04:32:14,609 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 (< .cse1 0) .cse6 .cse7)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0))) [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse6 (not (= 1 ~NP~0))) (.cse7 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= 0 |old(~pended~0)|))) (.cse18 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse12 (+ ~myStatus~0 1073741637))) (or .cse10 .cse11 (< 0 .cse12) .cse13 .cse14 .cse15 .cse16 (< .cse12 0) .cse17 .cse18)) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0)))) (and (or (= ~customIrp~0 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |old(~customIrp~0)| 0)))) (or .cse6 .cse7 .cse0 .cse1 .cse2 .cse8 .cse9 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse3 .cse4 .cse5))) [2018-11-23 04:32:14,610 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-23 04:32:14,610 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= 6 ~MPR3~0))) (.cse9 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse1 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 |old(~routine~0)|))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= 0 |old(~pended~0)|))) (.cse18 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse12 (+ ~myStatus~0 1073741637))) (or .cse10 .cse11 (< 0 .cse12) .cse13 .cse14 .cse15 .cse16 (< .cse12 0) .cse17 .cse18)) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse9) (or (= ~customIrp~0 0) .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6 (not (= |old(~customIrp~0)| 0))))) [2018-11-23 04:32:14,623 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 (< .cse1 0) .cse6 .cse7)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (not (= ~Executive~0 0))) [2018-11-23 04:32:14,623 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-23 04:32:14,624 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-23 04:32:14,624 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= ~Executive~0 0))) (.cse6 (not (= 1 ~NP~0))) (.cse7 (let ((.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse19 (not (= 0 |old(~routine~0)|))) (.cse20 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse21 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse22 (not (= 0 |old(~pended~0)|))) (.cse23 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse17 (+ ~myStatus~0 1073741637))) (or .cse15 .cse16 (< 0 .cse17) .cse18 .cse19 .cse20 .cse21 (< .cse17 0) .cse22 .cse23)) (or .cse15 .cse16 (not (= ~myStatus~0 0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) (.cse8 (not (= 5 ~MPR1~0))) (.cse9 (not (= ~KernelMode~0 0)))) (and (or (= ~customIrp~0 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |old(~customIrp~0)| 0)))) (let ((.cse10 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse11 (= 0 ~pended~0)) (.cse12 (<= 1 ~compRegistered~0)) (.cse14 (= 1 ~setEventCalled~0)) (.cse13 (= ~routine~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (and .cse10 .cse11 .cse12 .cse13 .cse14) (= ~s~0 ~MPR3~0)) (and .cse10 .cse11 (= |old(~s~0)| ~s~0) .cse12 .cse14 .cse13) .cse8 .cse9)))) [2018-11-23 04:32:14,624 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-23 04:32:14,624 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-23 04:32:14,631 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-23 04:32:14,631 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-23 04:32:14,631 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-23 04:32:14,631 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-23 04:32:14,631 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-23 04:32:14,631 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-23 04:32:14,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:32:14 BoogieIcfgContainer [2018-11-23 04:32:14,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:32:14,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:32:14,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:32:14,732 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:32:14,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:31:13" (3/4) ... [2018-11-23 04:32:14,736 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 04:32:14,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 04:32:14,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-23 04:32:14,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 04:32:14,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-11-23 04:32:14,781 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-23 04:32:14,783 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 04:32:14,813 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 04:32:14,814 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 04:32:14,814 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && (s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 04:32:14,815 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0) && ((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (customIrp == 0 && s == NP)) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0) && ((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (customIrp == 0 && s == NP)) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\old(myStatus) == 0)) || !(\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(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-11-23 04:32:14,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-23 04:32:14,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3) [2018-11-23 04:32:14,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s)) || (!(259 == status) && DC == s && (0 == pended && NP + 5 <= MPR3) && routine == 0) [2018-11-23 04:32:14,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && (customIrp == 0 || (((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-11-23 04:32:14,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-23 04:32:14,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-23 04:32:14,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && (((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && routine == 0) && 0 == myStatus) || (((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && myStatus + 1073741637 <= 0))) && Executive == 0) && DC == 2) && MPR3 == 6) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && SKIP2 == 4) || !(\old(myStatus) == 0)) || !(\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(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 04:32:14,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-23 04:32:14,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-23 04:32:14,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((customIrp == 0 && !(irpSp__MinorFunction == 0)) && 0 == pended) && 0 == compRegistered) && routine == 0) && \old(s) == s) && \old(myStatus) == myStatus) || (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-11-23 04:32:14,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-23 04:32:14,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (s == NP && 0 == pended) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || customIrp == 0) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && ((((((((((!(1 == NP) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && s == NP && 0 == pended) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) [2018-11-23 04:32:14,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 04:32:14,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && ((((((((((!(1 == NP) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) [2018-11-23 04:32:14,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && (0 <= status + 1073741670 && s == NP && 0 == pended) && \old(myStatus) == myStatus) [2018-11-23 04:32:14,830 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) [2018-11-23 04:32:14,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) [2018-11-23 04:32:14,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-23 04:32:14,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 04:32:14,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,841 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 04:32:14,841 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,842 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 04:32:14,842 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,842 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) [2018-11-23 04:32:14,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) [2018-11-23 04:32:14,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-11-23 04:32:14,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-23 04:32:14,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-23 04:32:14,983 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b5d494e1-3ad1-4fcb-a790-730fd5e70faa/bin-2019/utaipan/witness.graphml [2018-11-23 04:32:14,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:32:14,984 INFO L168 Benchmark]: Toolchain (without parser) took 62717.96 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 956.5 MB in the beginning and 1.8 GB in the end (delta: -879.1 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,985 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:32:14,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:32:14,985 INFO L168 Benchmark]: Boogie Preprocessor took 56.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,985 INFO L168 Benchmark]: RCFGBuilder took 1033.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 147.1 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,986 INFO L168 Benchmark]: TraceAbstraction took 60826.32 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 918.6 MB). Free memory was 944.7 MB in the beginning and 1.9 GB in the end (delta: -938.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,986 INFO L168 Benchmark]: Witness Printer took 251.84 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:32:14,988 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1033.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 147.1 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60826.32 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 918.6 MB). Free memory was 944.7 MB in the beginning and 1.9 GB in the end (delta: -938.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 251.84 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 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: ((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && s == NP && 0 == pended) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (s == NP && 0 == pended) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0) && ((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (customIrp == 0 && s == NP)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && ((((((((((!(1 == NP) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0) && ((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (customIrp == 0 && s == NP)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || customIrp == 0) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && ((((((((((!(1 == NP) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && (((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && routine == 0) && 0 == myStatus) || (((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && myStatus + 1073741637 <= 0))) && Executive == 0) && DC == 2) && MPR3 == 6) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && SKIP2 == 4) || !(\old(myStatus) == 0)) || !(\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(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: ((((customIrp == 0 && \old(s) == s && 1 == setEventCalled) || (((((((((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || compRegistered < 1)) || !(\old(WaitMode) == 0)) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && (customIrp == 0 || (((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && (s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) || ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || ((((((((!(myStatus == 0) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((0 < myStatus + 1073741637 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s)) || (!(259 == status) && DC == s && (0 == pended && NP + 5 <= MPR3) && routine == 0) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\old(myStatus) == 0)) || !(\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(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && (0 <= status + 1073741670 && s == NP && 0 == pended) && \old(myStatus) == myStatus) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((customIrp == 0 && !(irpSp__MinorFunction == 0)) && 0 == pended) && 0 == compRegistered) && routine == 0) && \old(s) == s) && \old(myStatus) == myStatus) || (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || ((((((((((SKIP1 < NP + 2 || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && ((((((((SKIP1 < NP + 2 || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 534 locations, 1 error locations. SAFE Result, 60.6s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 29.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 49932 SDtfs, 19372 SDslu, 223430 SDs, 0 SdLazy, 21056 SolverSat, 3237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1166 GetRequests, 419 SyntacticMatches, 8 SemanticMatches, 739 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=983occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9796444154520454 AbsIntWeakeningRatio, 1.7699115044247788 AbsIntAvgWeakeningVarsNumRemoved, 6.3584070796460175 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 96 MinimizatonAttempts, 2509 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1789 PreInvPairs, 2118 NumberOfFragments, 26996 HoareAnnotationTreeSize, 1789 FomulaSimplifications, 32530014 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 171 FomulaSimplificationsInter, 2173491 FormulaSimplificationTreeSizeReductionInter, 27.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6396 NumberOfCodeBlocks, 6396 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 6300 ConstructedInterpolants, 0 QuantifiedInterpolants, 887230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 94 PerfectInterpolantSequences, 75/89 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...