./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/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_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/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-635dfa2 [2018-12-09 19:24:48,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:24:48,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:24:48,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:24:48,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:24:48,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:24:48,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:24:48,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:24:48,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:24:48,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:24:48,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:24:48,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:24:48,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:24:48,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:24:48,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:24:48,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:24:48,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:24:48,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:24:48,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:24:48,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:24:48,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:24:48,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:24:48,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:24:48,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:24:48,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:24:48,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:24:48,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:24:48,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:24:48,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:24:48,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:24:48,955 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:24:48,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:24:48,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:24:48,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:24:48,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:24:48,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:24:48,957 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:24:48,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:24:48,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:24:48,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:24:48,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:24:48,968 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:24:48,969 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:24:48,969 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:24:48,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:24:48,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:24:48,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:24:48,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:24:48,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:24:48,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:24:48,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:24:48,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:24:48,971 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_68b501cc-09ec-4e22-9852-03b80ffbc104/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-12-09 19:24:48,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:24:49,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:24:49,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:24:49,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:24:49,007 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:24:49,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:24:49,054 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/data/20f76fbad/3d30c799832c452daaee2b5d56568c1f/FLAGb976d93db [2018-12-09 19:24:49,437 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:24:49,437 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:24:49,445 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/data/20f76fbad/3d30c799832c452daaee2b5d56568c1f/FLAGb976d93db [2018-12-09 19:24:49,800 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/data/20f76fbad/3d30c799832c452daaee2b5d56568c1f [2018-12-09 19:24:49,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:24:49,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:24:49,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:24:49,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:24:49,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:24:49,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:24:49" (1/1) ... [2018-12-09 19:24:49,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ade0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:49, skipping insertion in model container [2018-12-09 19:24:49,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:24:49" (1/1) ... [2018-12-09 19:24:49,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:24:49,849 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:24:50,039 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:24:50,042 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:24:50,147 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:24:50,159 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:24:50,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50 WrapperNode [2018-12-09 19:24:50,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:24:50,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:24:50,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:24:50,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:24:50,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:24:50,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:24:50,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:24:50,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:24:50,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... [2018-12-09 19:24:50,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:24:50,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:24:50,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:24:50,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:24:50,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/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-12-09 19:24:50,264 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-09 19:24:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-09 19:24:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-09 19:24:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-09 19:24:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-09 19:24:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-09 19:24:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-09 19:24:50,265 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-09 19:24:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:24:50,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:24:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-09 19:24:50,266 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-09 19:24:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-09 19:24:50,266 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-09 19:24:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-09 19:24:50,266 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-09 19:24:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-09 19:24:50,266 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-09 19:24:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-09 19:24:50,267 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-09 19:24:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-09 19:24:50,267 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-09 19:24:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-09 19:24:50,267 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-09 19:24:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-09 19:24:50,267 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-09 19:24:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-09 19:24:50,267 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-09 19:24:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-09 19:24:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-09 19:24:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-09 19:24:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-09 19:24:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-09 19:24:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-09 19:24:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-09 19:24:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-09 19:24:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-09 19:24:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-09 19:24:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-09 19:24:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-09 19:24:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-09 19:24:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-09 19:24:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-09 19:24:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-09 19:24:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:24:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:24:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-09 19:24:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-09 19:24:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-09 19:24:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-09 19:24:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:24:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:24:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-09 19:24:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-09 19:24:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-09 19:24:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-09 19:24:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-09 19:24:50,271 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-09 19:24:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-09 19:24:50,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-09 19:24:50,513 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,513 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,562 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,562 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,596 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,646 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,646 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,680 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,680 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,773 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,773 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,807 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,807 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,821 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,821 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,952 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:24:50,952 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:24:50,964 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:24:50,964 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:24:50,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:24:50 BoogieIcfgContainer [2018-12-09 19:24:50,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:24:50,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:24:50,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:24:50,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:24:50,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:24:49" (1/3) ... [2018-12-09 19:24:50,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:24:50, skipping insertion in model container [2018-12-09 19:24:50,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:24:50" (2/3) ... [2018-12-09 19:24:50,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c8ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:24:50, skipping insertion in model container [2018-12-09 19:24:50,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:24:50" (3/3) ... [2018-12-09 19:24:50,969 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:24:50,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:24:50,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:24:50,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:24:51,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:24:51,012 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:24:51,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:24:51,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:24:51,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:24:51,013 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:24:51,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:24:51,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:24:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-12-09 19:24:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:24:51,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,035 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-12-09 19:24:51,036 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-12-09 19:24:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:51,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:51,181 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-12-09 19:24:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:51,294 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-12-09 19:24:51,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:51,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 19:24:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:51,304 INFO L225 Difference]: With dead ends: 887 [2018-12-09 19:24:51,304 INFO L226 Difference]: Without dead ends: 507 [2018-12-09 19:24:51,308 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-12-09 19:24:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-09 19:24:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-12-09 19:24:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-12-09 19:24:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-12-09 19:24:51,355 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-12-09 19:24:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,356 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-12-09 19:24:51,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-12-09 19:24:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:24:51,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,357 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-12-09 19:24:51,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-12-09 19:24:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:51,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:51,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:51,453 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-12-09 19:24:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:51,619 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-12-09 19:24:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:51,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:24:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:51,623 INFO L225 Difference]: With dead ends: 789 [2018-12-09 19:24:51,623 INFO L226 Difference]: Without dead ends: 670 [2018-12-09 19:24:51,624 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-12-09 19:24:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-09 19:24:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-12-09 19:24:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-09 19:24:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-12-09 19:24:51,656 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-12-09 19:24:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,656 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-12-09 19:24:51,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-12-09 19:24:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:24:51,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,657 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-12-09 19:24:51,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-12-09 19:24:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:51,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:51,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:51,713 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-12-09 19:24:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:51,751 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-12-09 19:24:51,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:51,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:24:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:51,756 INFO L225 Difference]: With dead ends: 995 [2018-12-09 19:24:51,756 INFO L226 Difference]: Without dead ends: 819 [2018-12-09 19:24:51,757 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-12-09 19:24:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-09 19:24:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-12-09 19:24:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-09 19:24:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-12-09 19:24:51,780 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-12-09 19:24:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,780 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-12-09 19:24:51,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-12-09 19:24:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:24:51,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,781 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-12-09 19:24:51,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-12-09 19:24:51,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:51,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:51,811 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-12-09 19:24:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:51,901 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-12-09 19:24:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:51,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:24:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:51,905 INFO L225 Difference]: With dead ends: 1424 [2018-12-09 19:24:51,905 INFO L226 Difference]: Without dead ends: 1160 [2018-12-09 19:24:51,906 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-12-09 19:24:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-12-09 19:24:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-12-09 19:24:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-09 19:24:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-12-09 19:24:51,933 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-12-09 19:24:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,933 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-12-09 19:24:51,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-12-09 19:24:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:24:51,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,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] [2018-12-09 19:24:51,934 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-12-09 19:24:51,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:51,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:51,972 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-12-09 19:24:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,471 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-12-09 19:24:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:24:52,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-09 19:24:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,476 INFO L225 Difference]: With dead ends: 1562 [2018-12-09 19:24:52,476 INFO L226 Difference]: Without dead ends: 984 [2018-12-09 19:24:52,478 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-12-09 19:24:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-09 19:24:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-12-09 19:24:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-09 19:24:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-12-09 19:24:52,522 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-12-09 19:24:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:52,522 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-12-09 19:24:52,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-12-09 19:24:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:24:52,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:52,524 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-12-09 19:24:52,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:52,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-12-09 19:24:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:52,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:52,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:52,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:52,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:52,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:52,563 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-12-09 19:24:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,624 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-12-09 19:24:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:52,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 19:24:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,627 INFO L225 Difference]: With dead ends: 890 [2018-12-09 19:24:52,627 INFO L226 Difference]: Without dead ends: 886 [2018-12-09 19:24:52,628 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-12-09 19:24:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-12-09 19:24:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-12-09 19:24:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-09 19:24:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-12-09 19:24:52,653 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-12-09 19:24:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:52,653 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-12-09 19:24:52,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-12-09 19:24:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 19:24:52,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:52,655 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-12-09 19:24:52,655 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-12-09 19:24:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:52,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-12-09 19:24:52,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:52,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:52,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:52,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:52,684 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-12-09 19:24:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,724 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-12-09 19:24:52,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:52,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 19:24:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,727 INFO L225 Difference]: With dead ends: 1274 [2018-12-09 19:24:52,727 INFO L226 Difference]: Without dead ends: 1015 [2018-12-09 19:24:52,728 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-12-09 19:24:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-09 19:24:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-12-09 19:24:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-09 19:24:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-12-09 19:24:52,755 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-12-09 19:24:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:52,755 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-12-09 19:24:52,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-12-09 19:24:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 19:24:52,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:52,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] [2018-12-09 19:24:52,757 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:52,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-12-09 19:24:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:52,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:52,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:52,789 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-12-09 19:24:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,844 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-12-09 19:24:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:52,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-09 19:24:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,848 INFO L225 Difference]: With dead ends: 972 [2018-12-09 19:24:52,848 INFO L226 Difference]: Without dead ends: 954 [2018-12-09 19:24:52,849 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-12-09 19:24:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-09 19:24:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-12-09 19:24:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-09 19:24:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-12-09 19:24:52,892 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-12-09 19:24:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:52,892 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-12-09 19:24:52,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-12-09 19:24:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:24:52,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:52,894 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-12-09 19:24:52,895 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:52,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-12-09 19:24:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:52,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:52,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:52,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:52,933 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-12-09 19:24:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,971 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-12-09 19:24:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:52,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 19:24:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,974 INFO L225 Difference]: With dead ends: 1167 [2018-12-09 19:24:52,974 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:24:52,975 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-12-09 19:24:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:24:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-12-09 19:24:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-09 19:24:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-12-09 19:24:53,001 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-12-09 19:24:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,001 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-12-09 19:24:53,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-12-09 19:24:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:24:53,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,003 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-12-09 19:24:53,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-12-09 19:24:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:53,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:53,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:53,039 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-12-09 19:24:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,248 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-12-09 19:24:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:24:53,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 19:24:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,250 INFO L225 Difference]: With dead ends: 1014 [2018-12-09 19:24:53,250 INFO L226 Difference]: Without dead ends: 785 [2018-12-09 19:24:53,251 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-12-09 19:24:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-12-09 19:24:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-12-09 19:24:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-09 19:24:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-12-09 19:24:53,276 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-12-09 19:24:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,276 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-12-09 19:24:53,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-12-09 19:24:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:24:53,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,278 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-12-09 19:24:53,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-12-09 19:24:53,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:53,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:53,308 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-12-09 19:24:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,333 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-12-09 19:24:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:53,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-09 19:24:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,335 INFO L225 Difference]: With dead ends: 871 [2018-12-09 19:24:53,335 INFO L226 Difference]: Without dead ends: 775 [2018-12-09 19:24:53,336 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-12-09 19:24:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-12-09 19:24:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-12-09 19:24:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-12-09 19:24:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-12-09 19:24:53,368 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-12-09 19:24:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,368 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-12-09 19:24:53,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-12-09 19:24:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:24:53,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,369 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-12-09 19:24:53,369 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-12-09 19:24:53,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:53,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:53,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:53,391 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-12-09 19:24:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,464 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-12-09 19:24:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:53,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:24:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,466 INFO L225 Difference]: With dead ends: 938 [2018-12-09 19:24:53,467 INFO L226 Difference]: Without dead ends: 928 [2018-12-09 19:24:53,467 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-12-09 19:24:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-12-09 19:24:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-12-09 19:24:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-09 19:24:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-12-09 19:24:53,492 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-12-09 19:24:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,492 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-12-09 19:24:53,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-12-09 19:24:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:24:53,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,493 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-12-09 19:24:53,493 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-12-09 19:24:53,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:24:53,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:24:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:24:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:24:53,542 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-12-09 19:24:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,657 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-12-09 19:24:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:24:53,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-09 19:24:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,659 INFO L225 Difference]: With dead ends: 851 [2018-12-09 19:24:53,659 INFO L226 Difference]: Without dead ends: 847 [2018-12-09 19:24:53,660 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-12-09 19:24:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-09 19:24:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-12-09 19:24:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-09 19:24:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-12-09 19:24:53,687 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-12-09 19:24:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,687 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-12-09 19:24:53,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:24:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-12-09 19:24:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:24:53,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,688 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-12-09 19:24:53,689 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-12-09 19:24:53,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:24:53,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:24:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:24:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:24:53,740 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-12-09 19:24:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,826 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-12-09 19:24:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:24:53,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-09 19:24:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,829 INFO L225 Difference]: With dead ends: 886 [2018-12-09 19:24:53,829 INFO L226 Difference]: Without dead ends: 865 [2018-12-09 19:24:53,830 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-12-09 19:24:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-09 19:24:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-12-09 19:24:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-09 19:24:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-12-09 19:24:53,866 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-12-09 19:24:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,867 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-12-09 19:24:53,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:24:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-12-09 19:24:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:24:53,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,868 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-12-09 19:24:53,868 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-12-09 19:24:53,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:53,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:53,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:53,888 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-12-09 19:24:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,985 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-12-09 19:24:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:53,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 19:24:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,988 INFO L225 Difference]: With dead ends: 1081 [2018-12-09 19:24:53,988 INFO L226 Difference]: Without dead ends: 1049 [2018-12-09 19:24:53,988 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-12-09 19:24:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-09 19:24:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-12-09 19:24:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-09 19:24:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-12-09 19:24:54,019 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-12-09 19:24:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:54,019 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-12-09 19:24:54,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-12-09 19:24:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:24:54,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:54,021 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-12-09 19:24:54,021 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:54,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-12-09 19:24:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:54,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:54,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:54,041 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-12-09 19:24:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:54,075 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-12-09 19:24:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:24:54,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 19:24:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:54,078 INFO L225 Difference]: With dead ends: 966 [2018-12-09 19:24:54,079 INFO L226 Difference]: Without dead ends: 944 [2018-12-09 19:24:54,079 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-12-09 19:24:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-12-09 19:24:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-12-09 19:24:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-09 19:24:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-12-09 19:24:54,119 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-12-09 19:24:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:54,119 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-12-09 19:24:54,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-12-09 19:24:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:24:54,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:54,120 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-12-09 19:24:54,120 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:54,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-12-09 19:24:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:24:54,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:24:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:24:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:54,181 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-12-09 19:24:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:54,807 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-12-09 19:24:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:24:54,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-09 19:24:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:54,810 INFO L225 Difference]: With dead ends: 1110 [2018-12-09 19:24:54,810 INFO L226 Difference]: Without dead ends: 1016 [2018-12-09 19:24:54,811 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-12-09 19:24:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-12-09 19:24:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-12-09 19:24:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-09 19:24:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-12-09 19:24:54,842 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-12-09 19:24:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:54,842 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-12-09 19:24:54,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:24:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-12-09 19:24:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:24:54,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:54,844 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-12-09 19:24:54,845 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:54,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-12-09 19:24:54,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:54,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:54,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:24:54,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:54,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:24:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:24:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:54,906 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-12-09 19:24:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:55,933 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-12-09 19:24:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:24:55,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-09 19:24:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:55,937 INFO L225 Difference]: With dead ends: 1188 [2018-12-09 19:24:55,937 INFO L226 Difference]: Without dead ends: 1119 [2018-12-09 19:24:55,938 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-12-09 19:24:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-09 19:24:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-12-09 19:24:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-09 19:24:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-12-09 19:24:55,994 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-12-09 19:24:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:55,994 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-12-09 19:24:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:24:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-12-09 19:24:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:24:55,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:55,997 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-12-09 19:24:55,997 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:55,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-12-09 19:24:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:55,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:56,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:56,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:56,026 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-12-09 19:24:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:56,090 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-12-09 19:24:56,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:56,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 19:24:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:56,092 INFO L225 Difference]: With dead ends: 912 [2018-12-09 19:24:56,092 INFO L226 Difference]: Without dead ends: 907 [2018-12-09 19:24:56,093 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-12-09 19:24:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-09 19:24:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-12-09 19:24:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-12-09 19:24:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-12-09 19:24:56,126 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-12-09 19:24:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:56,126 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-12-09 19:24:56,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-12-09 19:24:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:24:56,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:56,127 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-12-09 19:24:56,127 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:56,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-12-09 19:24:56,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:56,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:56,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:56,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:56,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:56,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:56,147 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-12-09 19:24:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:56,213 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-12-09 19:24:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 19:24:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:56,217 INFO L225 Difference]: With dead ends: 1116 [2018-12-09 19:24:56,217 INFO L226 Difference]: Without dead ends: 875 [2018-12-09 19:24:56,218 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-12-09 19:24:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-09 19:24:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-12-09 19:24:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-09 19:24:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-12-09 19:24:56,257 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-12-09 19:24:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:56,257 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-12-09 19:24:56,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-12-09 19:24:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:24:56,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:56,258 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-12-09 19:24:56,258 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:56,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-12-09 19:24:56,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:56,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:56,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:56,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:56,301 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-12-09 19:24:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:56,631 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-12-09 19:24:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:56,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 19:24:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:56,633 INFO L225 Difference]: With dead ends: 885 [2018-12-09 19:24:56,633 INFO L226 Difference]: Without dead ends: 879 [2018-12-09 19:24:56,634 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-12-09 19:24:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-09 19:24:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-12-09 19:24:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-09 19:24:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-12-09 19:24:56,666 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-12-09 19:24:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:56,666 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-12-09 19:24:56,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-12-09 19:24:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:24:56,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:56,668 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-12-09 19:24:56,668 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:56,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-12-09 19:24:56,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:56,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:56,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:56,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:56,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:56,703 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-12-09 19:24:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:57,015 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-12-09 19:24:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:57,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 19:24:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:57,017 INFO L225 Difference]: With dead ends: 887 [2018-12-09 19:24:57,017 INFO L226 Difference]: Without dead ends: 851 [2018-12-09 19:24:57,018 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-12-09 19:24:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-09 19:24:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-12-09 19:24:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-09 19:24:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-12-09 19:24:57,050 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-12-09 19:24:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:57,050 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-12-09 19:24:57,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-12-09 19:24:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:24:57,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:57,052 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-12-09 19:24:57,052 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:57,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-12-09 19:24:57,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:57,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:57,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:57,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:57,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:57,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:57,082 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-12-09 19:24:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:57,403 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-12-09 19:24:57,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:57,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 19:24:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:57,407 INFO L225 Difference]: With dead ends: 855 [2018-12-09 19:24:57,407 INFO L226 Difference]: Without dead ends: 849 [2018-12-09 19:24:57,408 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-12-09 19:24:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-09 19:24:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-12-09 19:24:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-09 19:24:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-12-09 19:24:57,463 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-12-09 19:24:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:57,463 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-12-09 19:24:57,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-12-09 19:24:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:24:57,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:57,465 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-12-09 19:24:57,465 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:57,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-12-09 19:24:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:57,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:57,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:57,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:57,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:57,513 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-12-09 19:24:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:57,626 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-12-09 19:24:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:24:57,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 19:24:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:57,628 INFO L225 Difference]: With dead ends: 886 [2018-12-09 19:24:57,628 INFO L226 Difference]: Without dead ends: 854 [2018-12-09 19:24:57,629 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-12-09 19:24:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-12-09 19:24:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-12-09 19:24:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-09 19:24:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-12-09 19:24:57,663 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-12-09 19:24:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:57,663 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-12-09 19:24:57,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-12-09 19:24:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:24:57,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:57,665 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-12-09 19:24:57,665 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:57,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-12-09 19:24:57,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:57,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:24:57,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:57,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:24:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:24:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:57,715 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-12-09 19:24:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:57,894 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-12-09 19:24:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:24:57,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-09 19:24:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:57,898 INFO L225 Difference]: With dead ends: 876 [2018-12-09 19:24:57,898 INFO L226 Difference]: Without dead ends: 838 [2018-12-09 19:24:57,898 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-12-09 19:24:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-12-09 19:24:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-12-09 19:24:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-12-09 19:24:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-12-09 19:24:57,949 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-12-09 19:24:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:57,950 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-12-09 19:24:57,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:24:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-12-09 19:24:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:24:57,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:57,951 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-12-09 19:24:57,952 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-12-09 19:24:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:57,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:58,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:58,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:24:58,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:58,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:24:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:24:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:24:58,034 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-12-09 19:24:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:58,226 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-12-09 19:24:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:24:58,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-09 19:24:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:58,228 INFO L225 Difference]: With dead ends: 854 [2018-12-09 19:24:58,229 INFO L226 Difference]: Without dead ends: 836 [2018-12-09 19:24:58,229 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-12-09 19:24:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-09 19:24:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-12-09 19:24:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-12-09 19:24:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-12-09 19:24:58,261 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 55 [2018-12-09 19:24:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:58,261 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-12-09 19:24:58,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:24:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-12-09 19:24:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:24:58,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:58,262 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-12-09 19:24:58,262 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:58,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-12-09 19:24:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:58,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:58,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:58,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:24:58,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:58,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:24:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:24:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:24:58,356 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-12-09 19:24:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:58,547 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-12-09 19:24:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:24:58,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-09 19:24:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:58,550 INFO L225 Difference]: With dead ends: 849 [2018-12-09 19:24:58,550 INFO L226 Difference]: Without dead ends: 831 [2018-12-09 19:24:58,551 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-12-09 19:24:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-09 19:24:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-12-09 19:24:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-09 19:24:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-12-09 19:24:58,601 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 56 [2018-12-09 19:24:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:58,601 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-12-09 19:24:58,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:24:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-12-09 19:24:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:24:58,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:58,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] [2018-12-09 19:24:58,603 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 804739700, now seen corresponding path program 1 times [2018-12-09 19:24:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:58,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:58,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:58,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:58,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:58,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:58,653 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2018-12-09 19:24:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:59,166 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2018-12-09 19:24:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:24:59,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-09 19:24:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:59,169 INFO L225 Difference]: With dead ends: 1378 [2018-12-09 19:24:59,169 INFO L226 Difference]: Without dead ends: 1214 [2018-12-09 19:24:59,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-12-09 19:24:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2018-12-09 19:24:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-12-09 19:24:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2018-12-09 19:24:59,210 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2018-12-09 19:24:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2018-12-09 19:24:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2018-12-09 19:24:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:24:59,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:59,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] [2018-12-09 19:24:59,212 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-12-09 19:24:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:59,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:59,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:24:59,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:59,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:24:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:24:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:24:59,298 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2018-12-09 19:24:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:59,487 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2018-12-09 19:24:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:24:59,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-09 19:24:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:59,490 INFO L225 Difference]: With dead ends: 886 [2018-12-09 19:24:59,490 INFO L226 Difference]: Without dead ends: 866 [2018-12-09 19:24:59,491 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-12-09 19:24:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-12-09 19:24:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2018-12-09 19:24:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-12-09 19:24:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2018-12-09 19:24:59,540 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2018-12-09 19:24:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:59,540 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2018-12-09 19:24:59,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:24:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2018-12-09 19:24:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 19:24:59,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:59,542 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-12-09 19:24:59,543 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:59,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-12-09 19:24:59,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:59,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-12-09 19:24:59,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:59,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:24:59,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:59,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:24:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:24:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:24:59,636 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2018-12-09 19:24:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:59,792 INFO L93 Difference]: Finished difference Result 892 states and 1196 transitions. [2018-12-09 19:24:59,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:24:59,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-09 19:24:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:59,794 INFO L225 Difference]: With dead ends: 892 [2018-12-09 19:24:59,794 INFO L226 Difference]: Without dead ends: 867 [2018-12-09 19:24:59,794 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-12-09 19:24:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-09 19:24:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-12-09 19:24:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-09 19:24:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2018-12-09 19:24:59,827 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 59 [2018-12-09 19:24:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:59,827 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2018-12-09 19:24:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:24:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2018-12-09 19:24:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 19:24:59,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:59,828 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-12-09 19:24:59,828 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:59,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-12-09 19:24:59,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:59,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:59,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:59,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:59,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:59,854 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 3 states. [2018-12-09 19:24:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:59,884 INFO L93 Difference]: Finished difference Result 899 states and 1191 transitions. [2018-12-09 19:24:59,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:59,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 19:24:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:59,886 INFO L225 Difference]: With dead ends: 899 [2018-12-09 19:24:59,886 INFO L226 Difference]: Without dead ends: 867 [2018-12-09 19:24:59,886 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-12-09 19:24:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-09 19:24:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-12-09 19:24:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-09 19:24:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1156 transitions. [2018-12-09 19:24:59,919 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1156 transitions. Word has length 59 [2018-12-09 19:24:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:59,919 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1156 transitions. [2018-12-09 19:24:59,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1156 transitions. [2018-12-09 19:24:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 19:24:59,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:59,920 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-12-09 19:24:59,921 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:59,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-12-09 19:24:59,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:59,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:24:59,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:59,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:24:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:24:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:59,976 INFO L87 Difference]: Start difference. First operand 865 states and 1156 transitions. Second operand 9 states. [2018-12-09 19:25:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:00,113 INFO L93 Difference]: Finished difference Result 887 states and 1179 transitions. [2018-12-09 19:25:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:25:00,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-12-09 19:25:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:00,114 INFO L225 Difference]: With dead ends: 887 [2018-12-09 19:25:00,114 INFO L226 Difference]: Without dead ends: 853 [2018-12-09 19:25:00,115 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-12-09 19:25:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-12-09 19:25:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-12-09 19:25:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-12-09 19:25:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1136 transitions. [2018-12-09 19:25:00,147 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1136 transitions. Word has length 59 [2018-12-09 19:25:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:00,147 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1136 transitions. [2018-12-09 19:25:00,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:25:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1136 transitions. [2018-12-09 19:25:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:25:00,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:00,148 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-12-09 19:25:00,149 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-12-09 19:25:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:00,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-12-09 19:25:00,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:00,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:00,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:00,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:00,166 INFO L87 Difference]: Start difference. First operand 853 states and 1136 transitions. Second operand 4 states. [2018-12-09 19:25:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:00,261 INFO L93 Difference]: Finished difference Result 1009 states and 1359 transitions. [2018-12-09 19:25:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:00,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 19:25:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:00,263 INFO L225 Difference]: With dead ends: 1009 [2018-12-09 19:25:00,263 INFO L226 Difference]: Without dead ends: 898 [2018-12-09 19:25:00,264 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-12-09 19:25:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-12-09 19:25:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 860. [2018-12-09 19:25:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-12-09 19:25:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1152 transitions. [2018-12-09 19:25:00,297 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1152 transitions. Word has length 60 [2018-12-09 19:25:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:00,297 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1152 transitions. [2018-12-09 19:25:00,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1152 transitions. [2018-12-09 19:25:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:25:00,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:00,299 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-12-09 19:25:00,299 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:00,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-12-09 19:25:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:00,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:00,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:00,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-12-09 19:25:00,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:00,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:00,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:00,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:00,349 INFO L87 Difference]: Start difference. First operand 860 states and 1152 transitions. Second operand 11 states. [2018-12-09 19:25:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:00,446 INFO L93 Difference]: Finished difference Result 929 states and 1245 transitions. [2018-12-09 19:25:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:00,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-09 19:25:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:00,448 INFO L225 Difference]: With dead ends: 929 [2018-12-09 19:25:00,448 INFO L226 Difference]: Without dead ends: 874 [2018-12-09 19:25:00,449 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-12-09 19:25:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-09 19:25:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 864. [2018-12-09 19:25:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-09 19:25:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1170 transitions. [2018-12-09 19:25:00,483 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1170 transitions. Word has length 60 [2018-12-09 19:25:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:00,483 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1170 transitions. [2018-12-09 19:25:00,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1170 transitions. [2018-12-09 19:25:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:25:00,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:00,484 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-12-09 19:25:00,484 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:00,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-12-09 19:25:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:00,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:25:00,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:00,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:25:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:25:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:25:00,536 INFO L87 Difference]: Start difference. First operand 864 states and 1170 transitions. Second operand 9 states. [2018-12-09 19:25:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:00,675 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2018-12-09 19:25:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:25:00,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-09 19:25:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:00,677 INFO L225 Difference]: With dead ends: 895 [2018-12-09 19:25:00,677 INFO L226 Difference]: Without dead ends: 856 [2018-12-09 19:25:00,678 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-12-09 19:25:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-12-09 19:25:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-12-09 19:25:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-09 19:25:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-12-09 19:25:00,724 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 60 [2018-12-09 19:25:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:00,724 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-12-09 19:25:00,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:25:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-12-09 19:25:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:25:00,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:00,727 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-12-09 19:25:00,727 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:00,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-12-09 19:25:00,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:00,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:00,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:00,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:00,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:00,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:00,842 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 13 states. [2018-12-09 19:25:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:01,055 INFO L93 Difference]: Finished difference Result 873 states and 1172 transitions. [2018-12-09 19:25:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:01,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-09 19:25:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:01,058 INFO L225 Difference]: With dead ends: 873 [2018-12-09 19:25:01,058 INFO L226 Difference]: Without dead ends: 851 [2018-12-09 19:25:01,059 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-12-09 19:25:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-09 19:25:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-12-09 19:25:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:25:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1147 transitions. [2018-12-09 19:25:01,113 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1147 transitions. Word has length 62 [2018-12-09 19:25:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:01,113 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1147 transitions. [2018-12-09 19:25:01,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1147 transitions. [2018-12-09 19:25:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:25:01,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:01,115 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-12-09 19:25:01,115 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:01,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-12-09 19:25:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:01,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:01,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:01,136 INFO L87 Difference]: Start difference. First operand 851 states and 1147 transitions. Second operand 3 states. [2018-12-09 19:25:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:01,179 INFO L93 Difference]: Finished difference Result 1124 states and 1516 transitions. [2018-12-09 19:25:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:01,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-09 19:25:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:01,182 INFO L225 Difference]: With dead ends: 1124 [2018-12-09 19:25:01,182 INFO L226 Difference]: Without dead ends: 790 [2018-12-09 19:25:01,183 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-12-09 19:25:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-09 19:25:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2018-12-09 19:25:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-09 19:25:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 964 transitions. [2018-12-09 19:25:01,228 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 964 transitions. Word has length 62 [2018-12-09 19:25:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:01,229 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 964 transitions. [2018-12-09 19:25:01,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 964 transitions. [2018-12-09 19:25:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:25:01,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:01,230 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-12-09 19:25:01,230 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:01,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash 551685876, now seen corresponding path program 1 times [2018-12-09 19:25:01,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:01,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:01,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:01,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-12-09 19:25:01,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:01,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:25:01,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:01,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:01,324 INFO L87 Difference]: Start difference. First operand 741 states and 964 transitions. Second operand 12 states. [2018-12-09 19:25:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:01,492 INFO L93 Difference]: Finished difference Result 765 states and 989 transitions. [2018-12-09 19:25:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:01,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-09 19:25:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:01,493 INFO L225 Difference]: With dead ends: 765 [2018-12-09 19:25:01,494 INFO L226 Difference]: Without dead ends: 741 [2018-12-09 19:25:01,494 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-12-09 19:25:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-09 19:25:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2018-12-09 19:25:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-09 19:25:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 960 transitions. [2018-12-09 19:25:01,522 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 960 transitions. Word has length 66 [2018-12-09 19:25:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 960 transitions. [2018-12-09 19:25:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 960 transitions. [2018-12-09 19:25:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:25:01,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:01,523 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-12-09 19:25:01,523 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:01,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1661318765, now seen corresponding path program 1 times [2018-12-09 19:25:01,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:01,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:01,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:01,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:01,561 INFO L87 Difference]: Start difference. First operand 739 states and 960 transitions. Second operand 5 states. [2018-12-09 19:25:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:01,656 INFO L93 Difference]: Finished difference Result 773 states and 1000 transitions. [2018-12-09 19:25:01,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:01,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-09 19:25:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:01,658 INFO L225 Difference]: With dead ends: 773 [2018-12-09 19:25:01,658 INFO L226 Difference]: Without dead ends: 746 [2018-12-09 19:25:01,659 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-12-09 19:25:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-09 19:25:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-09 19:25:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-09 19:25:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 969 transitions. [2018-12-09 19:25:01,696 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 969 transitions. Word has length 62 [2018-12-09 19:25:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:01,696 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 969 transitions. [2018-12-09 19:25:01,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 969 transitions. [2018-12-09 19:25:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:25:01,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:01,697 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-12-09 19:25:01,697 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:01,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-12-09 19:25:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:25:01,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:01,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:01,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:01,763 INFO L87 Difference]: Start difference. First operand 744 states and 969 transitions. Second operand 12 states. [2018-12-09 19:25:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:01,908 INFO L93 Difference]: Finished difference Result 766 states and 992 transitions. [2018-12-09 19:25:01,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:01,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-09 19:25:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:01,910 INFO L225 Difference]: With dead ends: 766 [2018-12-09 19:25:01,910 INFO L226 Difference]: Without dead ends: 742 [2018-12-09 19:25:01,910 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-12-09 19:25:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-09 19:25:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-12-09 19:25:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-09 19:25:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 964 transitions. [2018-12-09 19:25:01,952 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 964 transitions. Word has length 63 [2018-12-09 19:25:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:01,953 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 964 transitions. [2018-12-09 19:25:01,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 964 transitions. [2018-12-09 19:25:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:25:01,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:01,954 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-12-09 19:25:01,954 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:01,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-12-09 19:25:01,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:01,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:01,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:01,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:25:02,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:02,034 INFO L87 Difference]: Start difference. First operand 742 states and 964 transitions. Second operand 12 states. [2018-12-09 19:25:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:02,179 INFO L93 Difference]: Finished difference Result 766 states and 989 transitions. [2018-12-09 19:25:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:02,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-09 19:25:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:02,180 INFO L225 Difference]: With dead ends: 766 [2018-12-09 19:25:02,180 INFO L226 Difference]: Without dead ends: 742 [2018-12-09 19:25:02,181 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-12-09 19:25:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-09 19:25:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-12-09 19:25:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-09 19:25:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 960 transitions. [2018-12-09 19:25:02,209 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 960 transitions. Word has length 67 [2018-12-09 19:25:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:02,209 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 960 transitions. [2018-12-09 19:25:02,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 960 transitions. [2018-12-09 19:25:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:25:02,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:02,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] [2018-12-09 19:25:02,211 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:02,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-12-09 19:25:02,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:25:02,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:02,274 INFO L87 Difference]: Start difference. First operand 740 states and 960 transitions. Second operand 12 states. [2018-12-09 19:25:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:02,426 INFO L93 Difference]: Finished difference Result 762 states and 983 transitions. [2018-12-09 19:25:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:02,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-09 19:25:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:02,429 INFO L225 Difference]: With dead ends: 762 [2018-12-09 19:25:02,429 INFO L226 Difference]: Without dead ends: 738 [2018-12-09 19:25:02,430 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-12-09 19:25:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-09 19:25:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 733. [2018-12-09 19:25:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-12-09 19:25:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 948 transitions. [2018-12-09 19:25:02,459 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 948 transitions. Word has length 62 [2018-12-09 19:25:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:02,459 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 948 transitions. [2018-12-09 19:25:02,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 948 transitions. [2018-12-09 19:25:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:25:02,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:02,460 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-12-09 19:25:02,460 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:02,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:02,460 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-12-09 19:25:02,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:02,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:02,547 INFO L87 Difference]: Start difference. First operand 733 states and 948 transitions. Second operand 13 states. [2018-12-09 19:25:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:02,712 INFO L93 Difference]: Finished difference Result 750 states and 966 transitions. [2018-12-09 19:25:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:02,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-09 19:25:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:02,714 INFO L225 Difference]: With dead ends: 750 [2018-12-09 19:25:02,714 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 19:25:02,715 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-12-09 19:25:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 19:25:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-09 19:25:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-09 19:25:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 941 transitions. [2018-12-09 19:25:02,743 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 941 transitions. Word has length 63 [2018-12-09 19:25:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:02,743 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 941 transitions. [2018-12-09 19:25:02,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 941 transitions. [2018-12-09 19:25:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:25:02,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:02,744 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-12-09 19:25:02,745 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:02,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-12-09 19:25:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:02,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:02,771 INFO L87 Difference]: Start difference. First operand 728 states and 941 transitions. Second operand 3 states. [2018-12-09 19:25:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:02,801 INFO L93 Difference]: Finished difference Result 858 states and 1114 transitions. [2018-12-09 19:25:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:02,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 19:25:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:02,803 INFO L225 Difference]: With dead ends: 858 [2018-12-09 19:25:02,803 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 19:25:02,804 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-12-09 19:25:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 19:25:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-09 19:25:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-09 19:25:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 938 transitions. [2018-12-09 19:25:02,833 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 938 transitions. Word has length 66 [2018-12-09 19:25:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:02,833 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 938 transitions. [2018-12-09 19:25:02,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 938 transitions. [2018-12-09 19:25:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:25:02,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:02,834 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:02,835 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:02,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash 500473129, now seen corresponding path program 1 times [2018-12-09 19:25:02,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:02,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:02,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:02,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:02,856 INFO L87 Difference]: Start difference. First operand 728 states and 938 transitions. Second operand 3 states. [2018-12-09 19:25:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:02,891 INFO L93 Difference]: Finished difference Result 937 states and 1206 transitions. [2018-12-09 19:25:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:02,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 19:25:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:02,894 INFO L225 Difference]: With dead ends: 937 [2018-12-09 19:25:02,894 INFO L226 Difference]: Without dead ends: 800 [2018-12-09 19:25:02,894 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-12-09 19:25:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-09 19:25:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 769. [2018-12-09 19:25:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-09 19:25:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 989 transitions. [2018-12-09 19:25:02,925 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 989 transitions. Word has length 80 [2018-12-09 19:25:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:02,926 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 989 transitions. [2018-12-09 19:25:02,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 989 transitions. [2018-12-09 19:25:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:25:02,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:02,927 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-12-09 19:25:02,927 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:02,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-12-09 19:25:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:02,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:02,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:02,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:02,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:02,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:02,950 INFO L87 Difference]: Start difference. First operand 769 states and 989 transitions. Second operand 5 states. [2018-12-09 19:25:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,003 INFO L93 Difference]: Finished difference Result 823 states and 1048 transitions. [2018-12-09 19:25:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:03,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 19:25:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,005 INFO L225 Difference]: With dead ends: 823 [2018-12-09 19:25:03,005 INFO L226 Difference]: Without dead ends: 771 [2018-12-09 19:25:03,005 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-12-09 19:25:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-09 19:25:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2018-12-09 19:25:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-09 19:25:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 988 transitions. [2018-12-09 19:25:03,035 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 988 transitions. Word has length 65 [2018-12-09 19:25:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,035 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 988 transitions. [2018-12-09 19:25:03,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 988 transitions. [2018-12-09 19:25:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:25:03,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,036 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-12-09 19:25:03,036 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-12-09 19:25:03,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:03,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:03,063 INFO L87 Difference]: Start difference. First operand 769 states and 988 transitions. Second operand 5 states. [2018-12-09 19:25:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,159 INFO L93 Difference]: Finished difference Result 833 states and 1063 transitions. [2018-12-09 19:25:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:03,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 19:25:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,161 INFO L225 Difference]: With dead ends: 833 [2018-12-09 19:25:03,161 INFO L226 Difference]: Without dead ends: 800 [2018-12-09 19:25:03,161 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-12-09 19:25:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-09 19:25:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 775. [2018-12-09 19:25:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-12-09 19:25:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 995 transitions. [2018-12-09 19:25:03,195 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 995 transitions. Word has length 65 [2018-12-09 19:25:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,195 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 995 transitions. [2018-12-09 19:25:03,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 995 transitions. [2018-12-09 19:25:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:25:03,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,196 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-12-09 19:25:03,196 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,196 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-12-09 19:25:03,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:03,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:03,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:03,247 INFO L87 Difference]: Start difference. First operand 775 states and 995 transitions. Second operand 11 states. [2018-12-09 19:25:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,366 INFO L93 Difference]: Finished difference Result 797 states and 1018 transitions. [2018-12-09 19:25:03,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:03,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-12-09 19:25:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,367 INFO L225 Difference]: With dead ends: 797 [2018-12-09 19:25:03,368 INFO L226 Difference]: Without dead ends: 771 [2018-12-09 19:25:03,368 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-12-09 19:25:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-09 19:25:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2018-12-09 19:25:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-09 19:25:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 981 transitions. [2018-12-09 19:25:03,399 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 981 transitions. Word has length 66 [2018-12-09 19:25:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,399 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 981 transitions. [2018-12-09 19:25:03,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 981 transitions. [2018-12-09 19:25:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:25:03,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,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, 1, 1, 1, 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-12-09 19:25:03,400 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-12-09 19:25:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:03,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:03,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:03,421 INFO L87 Difference]: Start difference. First operand 765 states and 981 transitions. Second operand 5 states. [2018-12-09 19:25:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,483 INFO L93 Difference]: Finished difference Result 806 states and 1025 transitions. [2018-12-09 19:25:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:03,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:25:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,486 INFO L225 Difference]: With dead ends: 806 [2018-12-09 19:25:03,486 INFO L226 Difference]: Without dead ends: 772 [2018-12-09 19:25:03,486 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-12-09 19:25:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-09 19:25:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 765. [2018-12-09 19:25:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-09 19:25:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 980 transitions. [2018-12-09 19:25:03,536 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 980 transitions. Word has length 67 [2018-12-09 19:25:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,537 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 980 transitions. [2018-12-09 19:25:03,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 980 transitions. [2018-12-09 19:25:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:03,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,538 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-12-09 19:25:03,538 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-12-09 19:25:03,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:03,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:03,607 INFO L87 Difference]: Start difference. First operand 765 states and 980 transitions. Second operand 6 states. [2018-12-09 19:25:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,684 INFO L93 Difference]: Finished difference Result 804 states and 1021 transitions. [2018-12-09 19:25:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:03,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 19:25:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,685 INFO L225 Difference]: With dead ends: 804 [2018-12-09 19:25:03,686 INFO L226 Difference]: Without dead ends: 772 [2018-12-09 19:25:03,686 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-12-09 19:25:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-09 19:25:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 767. [2018-12-09 19:25:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-09 19:25:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 982 transitions. [2018-12-09 19:25:03,716 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 982 transitions. Word has length 68 [2018-12-09 19:25:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,716 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 982 transitions. [2018-12-09 19:25:03,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 982 transitions. [2018-12-09 19:25:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:03,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,717 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-12-09 19:25:03,717 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-12-09 19:25:03,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:03,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:03,769 INFO L87 Difference]: Start difference. First operand 767 states and 982 transitions. Second operand 11 states. [2018-12-09 19:25:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:03,872 INFO L93 Difference]: Finished difference Result 792 states and 1009 transitions. [2018-12-09 19:25:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:03,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-09 19:25:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:03,873 INFO L225 Difference]: With dead ends: 792 [2018-12-09 19:25:03,874 INFO L226 Difference]: Without dead ends: 759 [2018-12-09 19:25:03,874 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-12-09 19:25:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-09 19:25:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-12-09 19:25:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-09 19:25:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 972 transitions. [2018-12-09 19:25:03,907 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 972 transitions. Word has length 68 [2018-12-09 19:25:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 972 transitions. [2018-12-09 19:25:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 972 transitions. [2018-12-09 19:25:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:03,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:03,908 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-12-09 19:25:03,908 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:03,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-12-09 19:25:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:03,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:03,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:03,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:03,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:03,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:03,955 INFO L87 Difference]: Start difference. First operand 759 states and 972 transitions. Second operand 6 states. [2018-12-09 19:25:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,027 INFO L93 Difference]: Finished difference Result 806 states and 1020 transitions. [2018-12-09 19:25:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:04,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 19:25:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,029 INFO L225 Difference]: With dead ends: 806 [2018-12-09 19:25:04,029 INFO L226 Difference]: Without dead ends: 754 [2018-12-09 19:25:04,029 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-12-09 19:25:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-12-09 19:25:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-12-09 19:25:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-12-09 19:25:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 959 transitions. [2018-12-09 19:25:04,059 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 959 transitions. Word has length 68 [2018-12-09 19:25:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,059 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 959 transitions. [2018-12-09 19:25:04,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 959 transitions. [2018-12-09 19:25:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:04,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,060 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-12-09 19:25:04,060 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-12-09 19:25:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:04,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:04,128 INFO L87 Difference]: Start difference. First operand 752 states and 959 transitions. Second operand 11 states. [2018-12-09 19:25:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,220 INFO L93 Difference]: Finished difference Result 774 states and 982 transitions. [2018-12-09 19:25:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:04,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-09 19:25:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,222 INFO L225 Difference]: With dead ends: 774 [2018-12-09 19:25:04,222 INFO L226 Difference]: Without dead ends: 742 [2018-12-09 19:25:04,223 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-12-09 19:25:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-09 19:25:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2018-12-09 19:25:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-09 19:25:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 945 transitions. [2018-12-09 19:25:04,253 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 945 transitions. Word has length 68 [2018-12-09 19:25:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,254 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 945 transitions. [2018-12-09 19:25:04,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 945 transitions. [2018-12-09 19:25:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:04,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,255 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-12-09 19:25:04,255 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-12-09 19:25:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:04,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:04,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:04,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:04,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:04,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:04,281 INFO L87 Difference]: Start difference. First operand 742 states and 945 transitions. Second operand 5 states. [2018-12-09 19:25:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,518 INFO L93 Difference]: Finished difference Result 803 states and 1024 transitions. [2018-12-09 19:25:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:04,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 19:25:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,519 INFO L225 Difference]: With dead ends: 803 [2018-12-09 19:25:04,519 INFO L226 Difference]: Without dead ends: 797 [2018-12-09 19:25:04,520 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-12-09 19:25:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-09 19:25:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 742. [2018-12-09 19:25:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-09 19:25:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 944 transitions. [2018-12-09 19:25:04,549 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 944 transitions. Word has length 68 [2018-12-09 19:25:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,549 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 944 transitions. [2018-12-09 19:25:04,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 944 transitions. [2018-12-09 19:25:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:04,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,550 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-12-09 19:25:04,550 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-12-09 19:25:04,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:04,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:04,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:04,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:04,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:04,574 INFO L87 Difference]: Start difference. First operand 742 states and 944 transitions. Second operand 5 states. [2018-12-09 19:25:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,630 INFO L93 Difference]: Finished difference Result 783 states and 988 transitions. [2018-12-09 19:25:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:04,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 19:25:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,631 INFO L225 Difference]: With dead ends: 783 [2018-12-09 19:25:04,631 INFO L226 Difference]: Without dead ends: 749 [2018-12-09 19:25:04,631 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-12-09 19:25:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-09 19:25:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 742. [2018-12-09 19:25:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-09 19:25:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 943 transitions. [2018-12-09 19:25:04,660 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 943 transitions. Word has length 69 [2018-12-09 19:25:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,660 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 943 transitions. [2018-12-09 19:25:04,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 943 transitions. [2018-12-09 19:25:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:04,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,661 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-12-09 19:25:04,661 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-12-09 19:25:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:04,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:04,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:04,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:04,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:04,706 INFO L87 Difference]: Start difference. First operand 742 states and 943 transitions. Second operand 6 states. [2018-12-09 19:25:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,761 INFO L93 Difference]: Finished difference Result 781 states and 984 transitions. [2018-12-09 19:25:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:04,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 19:25:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,762 INFO L225 Difference]: With dead ends: 781 [2018-12-09 19:25:04,762 INFO L226 Difference]: Without dead ends: 749 [2018-12-09 19:25:04,763 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-12-09 19:25:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-09 19:25:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 744. [2018-12-09 19:25:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-09 19:25:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 945 transitions. [2018-12-09 19:25:04,792 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 945 transitions. Word has length 69 [2018-12-09 19:25:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,792 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 945 transitions. [2018-12-09 19:25:04,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 945 transitions. [2018-12-09 19:25:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:04,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,793 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-12-09 19:25:04,793 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-12-09 19:25:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:04,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:04,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:04,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:04,853 INFO L87 Difference]: Start difference. First operand 744 states and 945 transitions. Second operand 11 states. [2018-12-09 19:25:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:04,939 INFO L93 Difference]: Finished difference Result 769 states and 972 transitions. [2018-12-09 19:25:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:04,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-09 19:25:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:04,940 INFO L225 Difference]: With dead ends: 769 [2018-12-09 19:25:04,940 INFO L226 Difference]: Without dead ends: 737 [2018-12-09 19:25:04,940 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-12-09 19:25:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-12-09 19:25:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-12-09 19:25:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-09 19:25:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 936 transitions. [2018-12-09 19:25:04,979 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 936 transitions. Word has length 69 [2018-12-09 19:25:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:04,979 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 936 transitions. [2018-12-09 19:25:04,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 936 transitions. [2018-12-09 19:25:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:04,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:04,980 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-12-09 19:25:04,980 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:04,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-12-09 19:25:04,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:04,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:05,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:05,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:05,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:05,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:05,019 INFO L87 Difference]: Start difference. First operand 737 states and 936 transitions. Second operand 6 states. [2018-12-09 19:25:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:05,078 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2018-12-09 19:25:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:05,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 19:25:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:05,079 INFO L225 Difference]: With dead ends: 776 [2018-12-09 19:25:05,079 INFO L226 Difference]: Without dead ends: 744 [2018-12-09 19:25:05,079 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-12-09 19:25:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-12-09 19:25:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 739. [2018-12-09 19:25:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-09 19:25:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 938 transitions. [2018-12-09 19:25:05,108 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 938 transitions. Word has length 69 [2018-12-09 19:25:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:05,108 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 938 transitions. [2018-12-09 19:25:05,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2018-12-09 19:25:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:05,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:05,109 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-12-09 19:25:05,109 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:05,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-12-09 19:25:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:05,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:05,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:05,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:05,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:05,161 INFO L87 Difference]: Start difference. First operand 739 states and 938 transitions. Second operand 11 states. [2018-12-09 19:25:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:05,252 INFO L93 Difference]: Finished difference Result 764 states and 965 transitions. [2018-12-09 19:25:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:05,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-09 19:25:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:05,253 INFO L225 Difference]: With dead ends: 764 [2018-12-09 19:25:05,253 INFO L226 Difference]: Without dead ends: 734 [2018-12-09 19:25:05,254 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-12-09 19:25:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-09 19:25:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-09 19:25:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-09 19:25:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 931 transitions. [2018-12-09 19:25:05,285 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 931 transitions. Word has length 69 [2018-12-09 19:25:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:05,285 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 931 transitions. [2018-12-09 19:25:05,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 931 transitions. [2018-12-09 19:25:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:05,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:05,286 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-12-09 19:25:05,286 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:05,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-12-09 19:25:05,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:05,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:05,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:05,361 INFO L87 Difference]: Start difference. First operand 734 states and 931 transitions. Second operand 11 states. [2018-12-09 19:25:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:05,487 INFO L93 Difference]: Finished difference Result 744 states and 940 transitions. [2018-12-09 19:25:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:05,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-09 19:25:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:05,488 INFO L225 Difference]: With dead ends: 744 [2018-12-09 19:25:05,488 INFO L226 Difference]: Without dead ends: 738 [2018-12-09 19:25:05,488 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-12-09 19:25:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-09 19:25:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 732. [2018-12-09 19:25:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-12-09 19:25:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 927 transitions. [2018-12-09 19:25:05,517 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 927 transitions. Word has length 69 [2018-12-09 19:25:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:05,517 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 927 transitions. [2018-12-09 19:25:05,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 927 transitions. [2018-12-09 19:25:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:05,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:05,518 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-12-09 19:25:05,518 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:05,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-12-09 19:25:05,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:05,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:05,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:05,537 INFO L87 Difference]: Start difference. First operand 732 states and 927 transitions. Second operand 5 states. [2018-12-09 19:25:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:05,812 INFO L93 Difference]: Finished difference Result 789 states and 1002 transitions. [2018-12-09 19:25:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:05,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 19:25:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:05,814 INFO L225 Difference]: With dead ends: 789 [2018-12-09 19:25:05,814 INFO L226 Difference]: Without dead ends: 727 [2018-12-09 19:25:05,815 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-12-09 19:25:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-09 19:25:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 676. [2018-12-09 19:25:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-09 19:25:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 856 transitions. [2018-12-09 19:25:05,848 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 856 transitions. Word has length 69 [2018-12-09 19:25:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:05,848 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 856 transitions. [2018-12-09 19:25:05,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 856 transitions. [2018-12-09 19:25:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:25:05,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:05,849 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-12-09 19:25:05,849 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-12-09 19:25:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:05,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:05,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:05,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:25:05,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:05,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:05,921 INFO L87 Difference]: Start difference. First operand 676 states and 856 transitions. Second operand 12 states. [2018-12-09 19:25:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:06,035 INFO L93 Difference]: Finished difference Result 704 states and 888 transitions. [2018-12-09 19:25:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:06,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-09 19:25:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:06,036 INFO L225 Difference]: With dead ends: 704 [2018-12-09 19:25:06,036 INFO L226 Difference]: Without dead ends: 681 [2018-12-09 19:25:06,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:25:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-12-09 19:25:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-12-09 19:25:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-12-09 19:25:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 863 transitions. [2018-12-09 19:25:06,063 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 863 transitions. Word has length 70 [2018-12-09 19:25:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:06,064 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 863 transitions. [2018-12-09 19:25:06,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 863 transitions. [2018-12-09 19:25:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:25:06,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:06,064 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-12-09 19:25:06,064 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:06,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-12-09 19:25:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:25:06,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:06,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:25:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:25:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:25:06,112 INFO L87 Difference]: Start difference. First operand 681 states and 863 transitions. Second operand 7 states. [2018-12-09 19:25:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:06,183 INFO L93 Difference]: Finished difference Result 727 states and 910 transitions. [2018-12-09 19:25:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:06,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 19:25:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:06,185 INFO L225 Difference]: With dead ends: 727 [2018-12-09 19:25:06,185 INFO L226 Difference]: Without dead ends: 682 [2018-12-09 19:25:06,185 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-12-09 19:25:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-09 19:25:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-09 19:25:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-09 19:25:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 859 transitions. [2018-12-09 19:25:06,212 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 859 transitions. Word has length 74 [2018-12-09 19:25:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:06,212 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 859 transitions. [2018-12-09 19:25:06,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:25:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 859 transitions. [2018-12-09 19:25:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:25:06,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:06,213 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-12-09 19:25:06,213 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:06,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:06,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-12-09 19:25:06,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:06,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-12-09 19:25:06,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:06,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:06,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:06,299 INFO L87 Difference]: Start difference. First operand 680 states and 859 transitions. Second operand 14 states. [2018-12-09 19:25:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:06,433 INFO L93 Difference]: Finished difference Result 702 states and 882 transitions. [2018-12-09 19:25:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:06,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-09 19:25:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:06,434 INFO L225 Difference]: With dead ends: 702 [2018-12-09 19:25:06,434 INFO L226 Difference]: Without dead ends: 670 [2018-12-09 19:25:06,434 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-12-09 19:25:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-09 19:25:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-12-09 19:25:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-09 19:25:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 844 transitions. [2018-12-09 19:25:06,481 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 844 transitions. Word has length 74 [2018-12-09 19:25:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:06,481 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 844 transitions. [2018-12-09 19:25:06,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 844 transitions. [2018-12-09 19:25:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:25:06,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:06,482 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-12-09 19:25:06,482 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:06,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-12-09 19:25:06,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:06,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:06,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:06,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:06,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:06,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:06,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:06,573 INFO L87 Difference]: Start difference. First operand 670 states and 844 transitions. Second operand 14 states. [2018-12-09 19:25:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:06,710 INFO L93 Difference]: Finished difference Result 694 states and 870 transitions. [2018-12-09 19:25:06,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:06,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-09 19:25:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:06,711 INFO L225 Difference]: With dead ends: 694 [2018-12-09 19:25:06,712 INFO L226 Difference]: Without dead ends: 667 [2018-12-09 19:25:06,712 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-12-09 19:25:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-09 19:25:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-12-09 19:25:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-12-09 19:25:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 839 transitions. [2018-12-09 19:25:06,738 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 839 transitions. Word has length 70 [2018-12-09 19:25:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:06,739 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 839 transitions. [2018-12-09 19:25:06,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2018-12-09 19:25:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:25:06,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:06,739 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-12-09 19:25:06,740 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-12-09 19:25:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:06,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:06,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:06,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:06,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:06,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:06,824 INFO L87 Difference]: Start difference. First operand 667 states and 839 transitions. Second operand 13 states. [2018-12-09 19:25:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:06,976 INFO L93 Difference]: Finished difference Result 684 states and 857 transitions. [2018-12-09 19:25:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:06,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-09 19:25:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:06,977 INFO L225 Difference]: With dead ends: 684 [2018-12-09 19:25:06,977 INFO L226 Difference]: Without dead ends: 655 [2018-12-09 19:25:06,977 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-12-09 19:25:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-09 19:25:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-12-09 19:25:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-09 19:25:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 823 transitions. [2018-12-09 19:25:07,003 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 823 transitions. Word has length 69 [2018-12-09 19:25:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,004 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 823 transitions. [2018-12-09 19:25:07,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 823 transitions. [2018-12-09 19:25:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:25:07,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,004 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-12-09 19:25:07,004 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-12-09 19:25:07,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:07,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:07,027 INFO L87 Difference]: Start difference. First operand 655 states and 823 transitions. Second operand 5 states. [2018-12-09 19:25:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:07,066 INFO L93 Difference]: Finished difference Result 702 states and 872 transitions. [2018-12-09 19:25:07,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:07,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 19:25:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:07,068 INFO L225 Difference]: With dead ends: 702 [2018-12-09 19:25:07,068 INFO L226 Difference]: Without dead ends: 659 [2018-12-09 19:25:07,068 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-12-09 19:25:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-09 19:25:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2018-12-09 19:25:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-09 19:25:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 822 transitions. [2018-12-09 19:25:07,097 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 822 transitions. Word has length 71 [2018-12-09 19:25:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,097 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 822 transitions. [2018-12-09 19:25:07,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 822 transitions. [2018-12-09 19:25:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:25:07,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,098 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-12-09 19:25:07,098 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-12-09 19:25:07,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:07,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:07,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:07,184 INFO L87 Difference]: Start difference. First operand 655 states and 822 transitions. Second operand 14 states. [2018-12-09 19:25:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:07,308 INFO L93 Difference]: Finished difference Result 679 states and 848 transitions. [2018-12-09 19:25:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:07,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-09 19:25:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:07,309 INFO L225 Difference]: With dead ends: 679 [2018-12-09 19:25:07,309 INFO L226 Difference]: Without dead ends: 648 [2018-12-09 19:25:07,310 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-12-09 19:25:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-12-09 19:25:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2018-12-09 19:25:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-09 19:25:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 812 transitions. [2018-12-09 19:25:07,337 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 812 transitions. Word has length 71 [2018-12-09 19:25:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,338 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 812 transitions. [2018-12-09 19:25:07,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 812 transitions. [2018-12-09 19:25:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:25:07,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,339 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-12-09 19:25:07,339 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-12-09 19:25:07,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:07,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:07,429 INFO L87 Difference]: Start difference. First operand 648 states and 812 transitions. Second operand 14 states. [2018-12-09 19:25:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:07,564 INFO L93 Difference]: Finished difference Result 712 states and 880 transitions. [2018-12-09 19:25:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:07,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-09 19:25:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:07,565 INFO L225 Difference]: With dead ends: 712 [2018-12-09 19:25:07,565 INFO L226 Difference]: Without dead ends: 642 [2018-12-09 19:25:07,566 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-12-09 19:25:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-09 19:25:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-12-09 19:25:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-12-09 19:25:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 803 transitions. [2018-12-09 19:25:07,592 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 803 transitions. Word has length 71 [2018-12-09 19:25:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,592 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 803 transitions. [2018-12-09 19:25:07,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 803 transitions. [2018-12-09 19:25:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:25:07,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,593 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-12-09 19:25:07,593 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-12-09 19:25:07,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:07,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:07,640 INFO L87 Difference]: Start difference. First operand 642 states and 803 transitions. Second operand 11 states. [2018-12-09 19:25:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:07,734 INFO L93 Difference]: Finished difference Result 669 states and 833 transitions. [2018-12-09 19:25:07,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:07,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-12-09 19:25:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:07,735 INFO L225 Difference]: With dead ends: 669 [2018-12-09 19:25:07,735 INFO L226 Difference]: Without dead ends: 624 [2018-12-09 19:25:07,735 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-12-09 19:25:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-09 19:25:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-12-09 19:25:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-12-09 19:25:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 775 transitions. [2018-12-09 19:25:07,762 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 775 transitions. Word has length 72 [2018-12-09 19:25:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,762 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 775 transitions. [2018-12-09 19:25:07,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 775 transitions. [2018-12-09 19:25:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:25:07,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,763 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-12-09 19:25:07,763 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-12-09 19:25:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:07,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:07,804 INFO L87 Difference]: Start difference. First operand 624 states and 775 transitions. Second operand 6 states. [2018-12-09 19:25:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:07,854 INFO L93 Difference]: Finished difference Result 665 states and 819 transitions. [2018-12-09 19:25:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:07,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-09 19:25:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:07,855 INFO L225 Difference]: With dead ends: 665 [2018-12-09 19:25:07,855 INFO L226 Difference]: Without dead ends: 629 [2018-12-09 19:25:07,855 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-12-09 19:25:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-12-09 19:25:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 624. [2018-12-09 19:25:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-12-09 19:25:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 773 transitions. [2018-12-09 19:25:07,881 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 773 transitions. Word has length 71 [2018-12-09 19:25:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:07,881 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 773 transitions. [2018-12-09 19:25:07,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 773 transitions. [2018-12-09 19:25:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:25:07,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:07,882 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-12-09 19:25:07,882 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:07,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-12-09 19:25:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:07,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:07,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:07,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:07,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:07,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:07,923 INFO L87 Difference]: Start difference. First operand 624 states and 773 transitions. Second operand 11 states. [2018-12-09 19:25:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:08,013 INFO L93 Difference]: Finished difference Result 649 states and 800 transitions. [2018-12-09 19:25:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:08,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-09 19:25:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:08,014 INFO L225 Difference]: With dead ends: 649 [2018-12-09 19:25:08,014 INFO L226 Difference]: Without dead ends: 616 [2018-12-09 19:25:08,014 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-12-09 19:25:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-09 19:25:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2018-12-09 19:25:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-09 19:25:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 762 transitions. [2018-12-09 19:25:08,042 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 762 transitions. Word has length 71 [2018-12-09 19:25:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:08,042 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 762 transitions. [2018-12-09 19:25:08,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 762 transitions. [2018-12-09 19:25:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:25:08,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:08,043 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:08,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:08,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-12-09 19:25:08,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:08,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:08,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:25:08,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:08,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:25:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:25:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:25:08,086 INFO L87 Difference]: Start difference. First operand 616 states and 762 transitions. Second operand 7 states. [2018-12-09 19:25:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:08,148 INFO L93 Difference]: Finished difference Result 670 states and 823 transitions. [2018-12-09 19:25:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:08,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-09 19:25:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:08,149 INFO L225 Difference]: With dead ends: 670 [2018-12-09 19:25:08,149 INFO L226 Difference]: Without dead ends: 614 [2018-12-09 19:25:08,149 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-12-09 19:25:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-12-09 19:25:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2018-12-09 19:25:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-09 19:25:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 752 transitions. [2018-12-09 19:25:08,184 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 752 transitions. Word has length 77 [2018-12-09 19:25:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:08,184 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 752 transitions. [2018-12-09 19:25:08,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:25:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 752 transitions. [2018-12-09 19:25:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:25:08,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:08,185 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-12-09 19:25:08,185 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:08,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-12-09 19:25:08,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:08,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:08,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:08,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:08,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:08,271 INFO L87 Difference]: Start difference. First operand 610 states and 752 transitions. Second operand 14 states. [2018-12-09 19:25:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:08,385 INFO L93 Difference]: Finished difference Result 669 states and 814 transitions. [2018-12-09 19:25:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:08,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-09 19:25:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:08,386 INFO L225 Difference]: With dead ends: 669 [2018-12-09 19:25:08,386 INFO L226 Difference]: Without dead ends: 598 [2018-12-09 19:25:08,386 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-12-09 19:25:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-09 19:25:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-12-09 19:25:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-09 19:25:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 733 transitions. [2018-12-09 19:25:08,411 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 733 transitions. Word has length 72 [2018-12-09 19:25:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:08,412 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 733 transitions. [2018-12-09 19:25:08,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 733 transitions. [2018-12-09 19:25:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 19:25:08,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:08,412 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-12-09 19:25:08,412 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:08,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-12-09 19:25:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:08,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:08,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:08,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-12-09 19:25:08,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:08,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:08,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:08,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:08,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:08,505 INFO L87 Difference]: Start difference. First operand 598 states and 733 transitions. Second operand 13 states. [2018-12-09 19:25:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:08,665 INFO L93 Difference]: Finished difference Result 618 states and 754 transitions. [2018-12-09 19:25:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:08,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-12-09 19:25:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:08,667 INFO L225 Difference]: With dead ends: 618 [2018-12-09 19:25:08,667 INFO L226 Difference]: Without dead ends: 593 [2018-12-09 19:25:08,667 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-12-09 19:25:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-09 19:25:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2018-12-09 19:25:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-12-09 19:25:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 725 transitions. [2018-12-09 19:25:08,692 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 725 transitions. Word has length 79 [2018-12-09 19:25:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:08,692 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 725 transitions. [2018-12-09 19:25:08,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 725 transitions. [2018-12-09 19:25:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:25:08,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:08,692 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-12-09 19:25:08,692 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:08,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-12-09 19:25:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:08,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:08,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:08,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:08,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:08,776 INFO L87 Difference]: Start difference. First operand 593 states and 725 transitions. Second operand 13 states. [2018-12-09 19:25:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:08,906 INFO L93 Difference]: Finished difference Result 595 states and 726 transitions. [2018-12-09 19:25:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:08,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-09 19:25:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:08,907 INFO L225 Difference]: With dead ends: 595 [2018-12-09 19:25:08,907 INFO L226 Difference]: Without dead ends: 540 [2018-12-09 19:25:08,908 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-12-09 19:25:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-12-09 19:25:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-12-09 19:25:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-12-09 19:25:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 667 transitions. [2018-12-09 19:25:08,930 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 667 transitions. Word has length 72 [2018-12-09 19:25:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 667 transitions. [2018-12-09 19:25:08,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2018-12-09 19:25:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:25:08,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:08,931 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-12-09 19:25:08,931 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:08,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-12-09 19:25:08,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:08,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:25:08,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:08,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:08,975 INFO L87 Difference]: Start difference. First operand 540 states and 667 transitions. Second operand 10 states. [2018-12-09 19:25:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:09,698 INFO L93 Difference]: Finished difference Result 1064 states and 1317 transitions. [2018-12-09 19:25:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:25:09,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-09 19:25:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:09,700 INFO L225 Difference]: With dead ends: 1064 [2018-12-09 19:25:09,700 INFO L226 Difference]: Without dead ends: 919 [2018-12-09 19:25:09,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:25:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-09 19:25:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 848. [2018-12-09 19:25:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-09 19:25:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1071 transitions. [2018-12-09 19:25:09,739 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1071 transitions. Word has length 73 [2018-12-09 19:25:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:09,739 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1071 transitions. [2018-12-09 19:25:09,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1071 transitions. [2018-12-09 19:25:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:25:09,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:09,740 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-12-09 19:25:09,740 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:09,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-12-09 19:25:09,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:09,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:09,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:09,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:09,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:09,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:09,775 INFO L87 Difference]: Start difference. First operand 848 states and 1071 transitions. Second operand 6 states. [2018-12-09 19:25:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,136 INFO L93 Difference]: Finished difference Result 1067 states and 1315 transitions. [2018-12-09 19:25:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:10,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-09 19:25:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,138 INFO L225 Difference]: With dead ends: 1067 [2018-12-09 19:25:10,138 INFO L226 Difference]: Without dead ends: 962 [2018-12-09 19:25:10,138 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-12-09 19:25:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-12-09 19:25:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 918. [2018-12-09 19:25:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-12-09 19:25:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1151 transitions. [2018-12-09 19:25:10,195 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1151 transitions. Word has length 73 [2018-12-09 19:25:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,195 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1151 transitions. [2018-12-09 19:25:10,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1151 transitions. [2018-12-09 19:25:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:25:10,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,196 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-12-09 19:25:10,196 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-12-09 19:25:10,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:10,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:10,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:10,274 INFO L87 Difference]: Start difference. First operand 918 states and 1151 transitions. Second operand 6 states. [2018-12-09 19:25:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,361 INFO L93 Difference]: Finished difference Result 1192 states and 1507 transitions. [2018-12-09 19:25:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:10,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-09 19:25:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,363 INFO L225 Difference]: With dead ends: 1192 [2018-12-09 19:25:10,363 INFO L226 Difference]: Without dead ends: 904 [2018-12-09 19:25:10,364 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-12-09 19:25:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-09 19:25:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-09 19:25:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-09 19:25:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1129 transitions. [2018-12-09 19:25:10,421 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1129 transitions. Word has length 77 [2018-12-09 19:25:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,421 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1129 transitions. [2018-12-09 19:25:10,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1129 transitions. [2018-12-09 19:25:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:25:10,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,422 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-12-09 19:25:10,422 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-12-09 19:25:10,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:10,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:10,454 INFO L87 Difference]: Start difference. First operand 904 states and 1129 transitions. Second operand 5 states. [2018-12-09 19:25:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,525 INFO L93 Difference]: Finished difference Result 949 states and 1177 transitions. [2018-12-09 19:25:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:10,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 19:25:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,527 INFO L225 Difference]: With dead ends: 949 [2018-12-09 19:25:10,527 INFO L226 Difference]: Without dead ends: 904 [2018-12-09 19:25:10,527 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-12-09 19:25:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-09 19:25:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-09 19:25:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-09 19:25:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1127 transitions. [2018-12-09 19:25:10,570 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1127 transitions. Word has length 75 [2018-12-09 19:25:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,570 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1127 transitions. [2018-12-09 19:25:10,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1127 transitions. [2018-12-09 19:25:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:25:10,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,570 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-12-09 19:25:10,571 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-12-09 19:25:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:10,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:10,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:10,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:10,619 INFO L87 Difference]: Start difference. First operand 904 states and 1127 transitions. Second operand 6 states. [2018-12-09 19:25:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,678 INFO L93 Difference]: Finished difference Result 945 states and 1169 transitions. [2018-12-09 19:25:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:10,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-09 19:25:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,679 INFO L225 Difference]: With dead ends: 945 [2018-12-09 19:25:10,679 INFO L226 Difference]: Without dead ends: 904 [2018-12-09 19:25:10,680 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-12-09 19:25:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-09 19:25:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-09 19:25:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-09 19:25:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1125 transitions. [2018-12-09 19:25:10,722 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1125 transitions. Word has length 75 [2018-12-09 19:25:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,722 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1125 transitions. [2018-12-09 19:25:10,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1125 transitions. [2018-12-09 19:25:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:25:10,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,723 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-12-09 19:25:10,723 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-12-09 19:25:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:10,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:10,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:10,770 INFO L87 Difference]: Start difference. First operand 904 states and 1125 transitions. Second operand 11 states. [2018-12-09 19:25:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,850 INFO L93 Difference]: Finished difference Result 926 states and 1148 transitions. [2018-12-09 19:25:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:10,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-09 19:25:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,852 INFO L225 Difference]: With dead ends: 926 [2018-12-09 19:25:10,852 INFO L226 Difference]: Without dead ends: 857 [2018-12-09 19:25:10,852 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-12-09 19:25:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-12-09 19:25:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 851. [2018-12-09 19:25:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:25:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1062 transitions. [2018-12-09 19:25:10,892 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1062 transitions. Word has length 75 [2018-12-09 19:25:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:10,892 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1062 transitions. [2018-12-09 19:25:10,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1062 transitions. [2018-12-09 19:25:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:25:10,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:10,893 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-12-09 19:25:10,893 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:10,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-12-09 19:25:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:10,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:10,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:10,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:10,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:10,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:10,910 INFO L87 Difference]: Start difference. First operand 851 states and 1062 transitions. Second operand 3 states. [2018-12-09 19:25:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:10,961 INFO L93 Difference]: Finished difference Result 914 states and 1130 transitions. [2018-12-09 19:25:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:10,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 19:25:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:10,963 INFO L225 Difference]: With dead ends: 914 [2018-12-09 19:25:10,963 INFO L226 Difference]: Without dead ends: 861 [2018-12-09 19:25:10,963 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-12-09 19:25:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-12-09 19:25:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 853. [2018-12-09 19:25:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-12-09 19:25:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1064 transitions. [2018-12-09 19:25:11,003 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1064 transitions. Word has length 80 [2018-12-09 19:25:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:11,003 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1064 transitions. [2018-12-09 19:25:11,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1064 transitions. [2018-12-09 19:25:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:25:11,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:11,004 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-12-09 19:25:11,004 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:11,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-12-09 19:25:11,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:11,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:11,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:11,078 INFO L87 Difference]: Start difference. First operand 853 states and 1064 transitions. Second operand 14 states. [2018-12-09 19:25:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:11,192 INFO L93 Difference]: Finished difference Result 881 states and 1093 transitions. [2018-12-09 19:25:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:11,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-09 19:25:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:11,194 INFO L225 Difference]: With dead ends: 881 [2018-12-09 19:25:11,194 INFO L226 Difference]: Without dead ends: 849 [2018-12-09 19:25:11,194 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-12-09 19:25:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-09 19:25:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-12-09 19:25:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-09 19:25:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1056 transitions. [2018-12-09 19:25:11,233 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1056 transitions. Word has length 77 [2018-12-09 19:25:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:11,233 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1056 transitions. [2018-12-09 19:25:11,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1056 transitions. [2018-12-09 19:25:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:25:11,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:11,234 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-12-09 19:25:11,234 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:11,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-12-09 19:25:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:11,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-12-09 19:25:11,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:11,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:11,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:11,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:11,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:11,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:11,264 INFO L87 Difference]: Start difference. First operand 849 states and 1056 transitions. Second operand 5 states. [2018-12-09 19:25:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:11,437 INFO L93 Difference]: Finished difference Result 1091 states and 1374 transitions. [2018-12-09 19:25:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:11,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-09 19:25:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:11,438 INFO L225 Difference]: With dead ends: 1091 [2018-12-09 19:25:11,438 INFO L226 Difference]: Without dead ends: 817 [2018-12-09 19:25:11,439 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-12-09 19:25:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-12-09 19:25:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 817. [2018-12-09 19:25:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-09 19:25:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1016 transitions. [2018-12-09 19:25:11,480 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1016 transitions. Word has length 81 [2018-12-09 19:25:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:11,480 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1016 transitions. [2018-12-09 19:25:11,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1016 transitions. [2018-12-09 19:25:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:25:11,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:11,481 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-12-09 19:25:11,481 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:11,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-12-09 19:25:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:11,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:11,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:11,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:25:11,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:11,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:11,541 INFO L87 Difference]: Start difference. First operand 817 states and 1016 transitions. Second operand 10 states. [2018-12-09 19:25:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:12,336 INFO L93 Difference]: Finished difference Result 867 states and 1065 transitions. [2018-12-09 19:25:12,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:12,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-09 19:25:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:12,337 INFO L225 Difference]: With dead ends: 867 [2018-12-09 19:25:12,337 INFO L226 Difference]: Without dead ends: 733 [2018-12-09 19:25:12,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:25:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-09 19:25:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 368. [2018-12-09 19:25:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-09 19:25:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-12-09 19:25:12,363 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 78 [2018-12-09 19:25:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:12,363 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-12-09 19:25:12,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-12-09 19:25:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:25:12,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:12,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, 1, 1, 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-12-09 19:25:12,364 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:12,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-12-09 19:25:12,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,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-12-09 19:25:12,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:25:12,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:25:12,457 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-12-09 19:25:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:12,552 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-12-09 19:25:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:25:12,552 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-12-09 19:25:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:12,553 INFO L225 Difference]: With dead ends: 383 [2018-12-09 19:25:12,553 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 19:25:12,554 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-12-09 19:25:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 19:25:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-12-09 19:25:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-09 19:25:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-12-09 19:25:12,575 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-12-09 19:25:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:12,575 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-12-09 19:25:12,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-12-09 19:25:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 19:25:12,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:12,576 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-12-09 19:25:12,576 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:12,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-12-09 19:25:12,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:12,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:12,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:25:12,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:12,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:12,604 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-12-09 19:25:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:12,732 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-12-09 19:25:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:25:12,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 19:25:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:12,733 INFO L225 Difference]: With dead ends: 445 [2018-12-09 19:25:12,733 INFO L226 Difference]: Without dead ends: 303 [2018-12-09 19:25:12,733 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-12-09 19:25:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-09 19:25:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-12-09 19:25:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 19:25:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-12-09 19:25:12,749 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-12-09 19:25:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:12,749 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-12-09 19:25:12,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-12-09 19:25:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 19:25:12,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:12,749 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-12-09 19:25:12,749 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:12,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:12,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-12-09 19:25:12,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:12,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:12,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:12,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:25:12,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:12,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:25:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:25:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:12,814 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-12-09 19:25:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:13,373 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-12-09 19:25:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:25:13,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-12-09 19:25:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:13,375 INFO L225 Difference]: With dead ends: 289 [2018-12-09 19:25:13,375 INFO L226 Difference]: Without dead ends: 266 [2018-12-09 19:25:13,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:25:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-09 19:25:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-12-09 19:25:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 19:25:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-12-09 19:25:13,402 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-12-09 19:25:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:13,403 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-12-09 19:25:13,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:25:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-12-09 19:25:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 19:25:13,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:13,403 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-12-09 19:25:13,404 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:13,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-12-09 19:25:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:13,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:13,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:13,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:13,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:13,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:13,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:13,426 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-09 19:25:13,428 INFO L205 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-12-09 19:25:13,452 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:13,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:13,574 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:25:13,575 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-12-09 19:25:13,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:13,580 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:25:13,664 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 75.08% of their original sizes. [2018-12-09 19:25:13,664 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:25:13,718 INFO L418 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-12-09 19:25:13,718 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:25:13,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:25:13,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 19:25:13,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:13,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:13,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:13,720 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2018-12-09 19:25:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:14,941 INFO L93 Difference]: Finished difference Result 649 states and 764 transitions. [2018-12-09 19:25:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:25:14,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-09 19:25:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:14,942 INFO L225 Difference]: With dead ends: 649 [2018-12-09 19:25:14,942 INFO L226 Difference]: Without dead ends: 485 [2018-12-09 19:25:14,942 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-12-09 19:25:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-09 19:25:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 465. [2018-12-09 19:25:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-12-09 19:25:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 545 transitions. [2018-12-09 19:25:14,975 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 545 transitions. Word has length 114 [2018-12-09 19:25:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:14,975 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 545 transitions. [2018-12-09 19:25:14,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 545 transitions. [2018-12-09 19:25:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 19:25:14,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:14,976 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-12-09 19:25:14,976 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:14,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-12-09 19:25:14,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:14,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:14,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:14,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:15,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:15,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:25:15,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:15,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:25:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:25:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:25:15,022 INFO L87 Difference]: Start difference. First operand 465 states and 545 transitions. Second operand 8 states. [2018-12-09 19:25:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:15,099 INFO L93 Difference]: Finished difference Result 483 states and 564 transitions. [2018-12-09 19:25:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:25:15,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-09 19:25:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:15,100 INFO L225 Difference]: With dead ends: 483 [2018-12-09 19:25:15,100 INFO L226 Difference]: Without dead ends: 349 [2018-12-09 19:25:15,100 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-12-09 19:25:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-09 19:25:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-09 19:25:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-09 19:25:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 381 transitions. [2018-12-09 19:25:15,124 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 381 transitions. Word has length 101 [2018-12-09 19:25:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:15,124 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 381 transitions. [2018-12-09 19:25:15,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:25:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 381 transitions. [2018-12-09 19:25:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 19:25:15,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:15,125 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-12-09 19:25:15,125 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:15,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2001585538, now seen corresponding path program 1 times [2018-12-09 19:25:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:15,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:15,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:15,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:15,168 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-09 19:25:15,168 INFO L205 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-12-09 19:25:15,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:15,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:15,214 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:25:15,215 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-12-09 19:25:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:15,217 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:25:15,259 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 74.99% of their original sizes. [2018-12-09 19:25:15,259 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:25:15,297 INFO L418 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-12-09 19:25:15,297 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:25:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:25:15,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 19:25:15,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:15,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:25:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:25:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:15,298 INFO L87 Difference]: Start difference. First operand 335 states and 381 transitions. Second operand 10 states. [2018-12-09 19:25:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:16,135 INFO L93 Difference]: Finished difference Result 425 states and 483 transitions. [2018-12-09 19:25:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:25:16,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-09 19:25:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:16,135 INFO L225 Difference]: With dead ends: 425 [2018-12-09 19:25:16,135 INFO L226 Difference]: Without dead ends: 296 [2018-12-09 19:25:16,136 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-12-09 19:25:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-09 19:25:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 147. [2018-12-09 19:25:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 19:25:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-12-09 19:25:16,149 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 114 [2018-12-09 19:25:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:16,149 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-12-09 19:25:16,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:25:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-12-09 19:25:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 19:25:16,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:16,150 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-12-09 19:25:16,150 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:16,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-12-09 19:25:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:25:16,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:16,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:16,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:16,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:16,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:16,213 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-12-09 19:25:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:16,482 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-12-09 19:25:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:25:16,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-09 19:25:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:16,482 INFO L225 Difference]: With dead ends: 169 [2018-12-09 19:25:16,482 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 19:25:16,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 19:25:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-09 19:25:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 19:25:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-12-09 19:25:16,495 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-12-09 19:25:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:16,495 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-12-09 19:25:16,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-12-09 19:25:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 19:25:16,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:16,496 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-12-09 19:25:16,496 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:16,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-12-09 19:25:16,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:25:16,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:25:16,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:16,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:25:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:25:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:25:16,537 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-12-09 19:25:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:16,830 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-12-09 19:25:16,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:25:16,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-12-09 19:25:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:16,830 INFO L225 Difference]: With dead ends: 280 [2018-12-09 19:25:16,830 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 19:25:16,831 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-12-09 19:25:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 19:25:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-09 19:25:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 19:25:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-12-09 19:25:16,843 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-12-09 19:25:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:16,844 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-12-09 19:25:16,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:25:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-12-09 19:25:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 19:25:16,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:16,844 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-12-09 19:25:16,844 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:16,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-12-09 19:25:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:25:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:16,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:16,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:16,863 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-12-09 19:25:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:16,882 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-12-09 19:25:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:16,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-09 19:25:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:16,882 INFO L225 Difference]: With dead ends: 192 [2018-12-09 19:25:16,883 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 19:25:16,883 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-12-09 19:25:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 19:25:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-12-09 19:25:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 19:25:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-12-09 19:25:16,898 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-12-09 19:25:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:16,898 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-12-09 19:25:16,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-12-09 19:25:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 19:25:16,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:16,899 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-12-09 19:25:16,899 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:16,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-12-09 19:25:16,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:16,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:25:16,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:25:16,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:16,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:25:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:25:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:25:16,973 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-12-09 19:25:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:17,233 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-12-09 19:25:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:17,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-12-09 19:25:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:17,234 INFO L225 Difference]: With dead ends: 152 [2018-12-09 19:25:17,234 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:25:17,234 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-12-09 19:25:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:25:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:25:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:25:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:25:17,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-12-09 19:25:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:17,235 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:25:17,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:25:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:25:17,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:25:17,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:25:17,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:18,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:25:19,271 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 1 [2018-12-09 19:25:19,607 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2018-12-09 19:25:19,937 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-12-09 19:25:20,358 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 95 [2018-12-09 19:25:20,559 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-09 19:25:20,919 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2018-12-09 19:25:21,055 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-09 19:25:21,754 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-12-09 19:25:22,075 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 59 [2018-12-09 19:25:22,631 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 119 [2018-12-09 19:25:22,900 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 88 [2018-12-09 19:25:23,061 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-12-09 19:25:23,747 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94 [2018-12-09 19:25:24,445 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2018-12-09 19:25:25,524 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 233 DAG size of output: 138 [2018-12-09 19:25:25,710 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-12-09 19:25:26,070 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-12-09 19:25:26,299 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2018-12-09 19:25:27,346 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-12-09 19:25:28,792 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 241 DAG size of output: 141 [2018-12-09 19:25:29,134 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 99 [2018-12-09 19:25:29,692 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 125 [2018-12-09 19:25:29,907 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2018-12-09 19:25:30,183 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 99 [2018-12-09 19:25:30,614 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 97 [2018-12-09 19:25:31,265 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2018-12-09 19:25:31,623 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-12-09 19:25:31,962 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-09 19:25:32,348 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 1 [2018-12-09 19:25:32,712 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-12-09 19:25:34,381 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-12-09 19:25:34,699 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 94 [2018-12-09 19:25:35,305 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-12-09 19:25:36,010 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 97 [2018-12-09 19:25:36,699 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 91 [2018-12-09 19:25:37,028 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2018-12-09 19:25:38,047 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-09 19:25:38,362 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2018-12-09 19:25:38,786 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-12-09 19:25:39,141 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-09 19:25:39,274 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-12-09 19:25:39,466 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-12-09 19:25:39,668 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2018-12-09 19:25:39,997 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-12-09 19:25:40,333 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2018-12-09 19:25:40,567 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2018-12-09 19:25:40,836 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2018-12-09 19:25:41,768 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 98 [2018-12-09 19:25:42,866 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 145 DAG size of output: 97 [2018-12-09 19:25:44,442 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 166 DAG size of output: 102 [2018-12-09 19:25:44,656 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 1 [2018-12-09 19:25:45,157 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 103 [2018-12-09 19:25:45,733 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2018-12-09 19:25:45,992 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-12-09 19:25:47,859 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2018-12-09 19:25:48,498 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-12-09 19:25:50,121 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 241 DAG size of output: 141 [2018-12-09 19:25:50,351 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-09 19:25:50,925 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2018-12-09 19:25:51,035 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2018-12-09 19:25:51,320 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 56 [2018-12-09 19:25:51,539 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-09 19:25:51,839 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 94 [2018-12-09 19:25:52,182 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-12-09 19:25:52,427 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 70 [2018-12-09 19:25:52,853 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2018-12-09 19:25:53,177 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 86 [2018-12-09 19:25:53,501 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 110 [2018-12-09 19:25:53,810 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-12-09 19:25:54,996 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 224 DAG size of output: 137 [2018-12-09 19:25:55,680 WARN L180 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 101 [2018-12-09 19:25:56,094 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 86 [2018-12-09 19:25:56,326 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-12-09 19:25:56,790 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2018-12-09 19:25:57,028 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-12-09 19:25:57,548 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2018-12-09 19:25:58,173 WARN L180 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-12-09 19:25:58,371 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-09 19:25:58,560 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-09 19:25:58,839 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-12-09 19:25:59,388 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 62 [2018-12-09 19:25:59,582 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-09 19:26:00,159 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 97 [2018-12-09 19:26:00,339 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 1 [2018-12-09 19:26:01,574 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 187 DAG size of output: 87 [2018-12-09 19:26:01,740 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-12-09 19:26:02,214 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2018-12-09 19:26:03,600 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 168 DAG size of output: 108 [2018-12-09 19:26:04,116 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-12-09 19:26:04,403 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2018-12-09 19:26:04,487 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L444 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~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))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5))) (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (let ((.cse7 (or .cse0 (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5 .cse6)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse7 .cse8 (< 0 .cse9) (< .cse9 0))) (or .cse7 .cse8 (not (= ~myStatus~0 0))))) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0))))) [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse16 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse17 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse8 (not (= ~DeviceUsageTypePaging~0 1))) (.cse9 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (let ((.cse18 (or .cse11 (or .cse12 .cse13 .cse14 .cse15 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse16 .cse17)) (.cse19 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse18 .cse19 (< 0 .cse10) (< .cse10 0)) (or .cse18 .cse19 (not (= ~myStatus~0 0)))))) (.cse7 (not (= ~KernelMode~0 0))) (.cse4 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse8 .cse9 .cse0 (not (= 0 .cse10)) .cse5 .cse6 .cse7 (not (= |old(~customIrp~0)| 0))) (or .cse4 (or .cse11 (or .cse12 .cse13 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse14 .cse15 .cse16 .cse17 (< ~IPC~0 (+ ~DC~0 5))))))) [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-12-09 19:26:04,488 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-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-12-09 19:26:04,488 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)))))) [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (.cse2 (<= .cse1 0))) (and (or .cse0 (and (or (< 0 .cse1) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse2 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse0) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse2))))) [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.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 (= ~Executive~0 0)))) (and (or (= ~customIrp~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 .cse2 .cse8 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse9 .cse3 .cse4)))) [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse1 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse9 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse3 .cse4 .cse7 .cse8 .cse0 .cse1 (= ~customIrp~0 0) (not (= 0 .cse9)) .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-09 19:26:04,489 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-12-09 19:26:04,490 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-12-09 19:26:04,490 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.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 (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 0) .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 .cse2 .cse8 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse9 .cse3 .cse4)))) [2018-12-09 19:26:04,490 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse2 (not (= 2 ~DC~0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse4 (not (= 7 ~IPC~0))) (.cse7 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse1 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse9 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= ~KernelMode~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse3 .cse4 .cse7 .cse8 .cse0 .cse1 (= ~customIrp~0 0) (not (= 0 .cse9)) .cse5 .cse6 (not (= |old(~customIrp~0)| 0)))))) [2018-12-09 19:26:04,490 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-12-09 19:26:04,490 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-09 19:26:04,490 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.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 (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse2 .cse8 .cse9 .cse3 .cse4)))) [2018-12-09 19:26:04,490 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse7 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 1 ~NP~0))) (.cse6 (let ((.cse10 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (not (= 0 |old(~pended~0)|))) (.cse19 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse10 .cse11 (< 0 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse7 0) .cse17 .cse18 .cse19) (or .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.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 (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 (not (= 0 .cse7)) .cse8 .cse9 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse6 .cse0 .cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse2 .cse8 .cse9 .cse3 .cse4)))) [2018-12-09 19:26:04,490 INFO L444 ceAbstractionStarter]: At program point L1786(lines 1785 1816) 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)|)) (and (= ~customIrp~0 0) (= ~UNLOADED~0 0) (= ~MPR1~0 5) (= ~IPC~0 7) (= ~Executive~0 0) (= ~DC~0 2) (= ~NP~0 1) (= ~DeviceUsageTypePaging~0 1) (= ~KernelMode~0 0) (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)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 (<= .cse6 0) .cse10)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~myStatus~0) .cse10)))) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-12-09 19:26:04,490 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-12-09 19:26:04,490 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (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 .cse12 .cse11 .cse4 .cse7))))) [2018-12-09 19:26:04,491 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-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-12-09 19:26:04,491 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-12-09 19:26:04,491 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (and (= 0 ~pended~0) .cse13))) (let ((.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (= ~IPC~0 ~s~0)) (.cse8 (= ~DC~0 ~s~0)) (.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (and .cse0 .cse3 .cse7)) (.cse12 (= 0 main_~status~9)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse10) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse12 .cse4 .cse5 .cse7) (and .cse0 (= ~routine~0 0) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 ~compRegistered~0) .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse8 (not (= 259 main_~status~9)) .cse9 .cse2 .cse6 .cse10) (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 .cse12 .cse11 .cse4 .cse7))))) [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-12-09 19:26:04,491 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse4 (= ~lowerDriverReturn~0 main_~status~9)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (<= ~s~0 ~DC~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (and (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse5 .cse6 (and .cse3 .cse4)) (and (and .cse5 .cse6 .cse3) (= ~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)|)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse3 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse0 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-12-09 19:26:04,491 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-12-09 19:26:04,491 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-12-09 19:26:04,492 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)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 (<= .cse6 0) .cse10)) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~myStatus~0) .cse10) (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-12-09 19:26:04,492 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (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 .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (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)|))))) [2018-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-12-09 19:26:04,492 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse13 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse13 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse10 (= ~DC~0 ~s~0)) (.cse11 (and .cse4 .cse1 .cse7)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9) (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 .cse6 .cse2 .cse7 .cse3) (and .cse10 (not (= 259 main_~status~9)) .cse11 .cse12 .cse6 .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse4 .cse13 (= ~routine~0 0) .cse5 .cse6 .cse7 .cse3 (<= 1 ~compRegistered~0) .cse8 .cse9) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse11 .cse12 .cse6 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse3 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)))))) [2018-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-12-09 19:26:04,492 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse0 (= ~UNLOADED~0 0)) (.cse5 (= ~NP~0 1)) (.cse1 (= ~MPR1~0 5)) (.cse2 (= ~IPC~0 7)) (.cse6 (= ~DeviceUsageTypePaging~0 1)) (.cse7 (= ~KernelMode~0 0)) (.cse3 (= ~Executive~0 0)) (.cse4 (= ~DC~0 2)) (.cse8 (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (= 0 ~pended~0)) (.cse12 (= ~s~0 ~NP~0)) (.cse13 (= 0 ~compRegistered~0)) (.cse14 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (= ~routine~0 0)) (.cse17 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 .cse9) .cse16 .cse17 .cse18 (<= .cse9 0) .cse19) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~myStatus~0) .cse19))))) (or (and (= ~customIrp~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse7 (= .cse9 0) .cse3 .cse4 .cse8)))) (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-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-12-09 19:26:04,492 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-12-09 19:26:04,492 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-12-09 19:26:04,493 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-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-12-09 19:26:04,493 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-12-09 19:26:04,493 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 (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-12-09 19:26:04,493 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0) .cse3)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~customIrp~0 0)))) [2018-12-09 19:26:04,493 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-12-09 19:26:04,494 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-12-09 19:26:04,494 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-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-12-09 19:26:04,494 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-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-12-09 19:26:04,494 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-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-12-09 19:26:04,494 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-12-09 19:26:04,495 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-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-12-09 19:26:04,495 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-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-12-09 19:26:04,495 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-12-09 19:26:04,495 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-12-09 19:26:04,496 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-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-12-09 19:26:04,496 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-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-12-09 19:26:04,496 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-12-09 19:26:04,496 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-12-09 19:26:04,496 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse32 (+ ~myStatus~0 1073741637))) (let ((.cse6 (< 0 .cse32)) (.cse7 (< .cse32 0)) (.cse9 (not (= ~myStatus~0 0))) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 ~pended~0))) (.cse25 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse26 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse11 (< ~compRegistered~0 1)) (.cse12 (not (= 1 ~routine~0))) (.cse14 (not (= ~SKIP2~0 4))) (.cse16 (not (= 6 ~MPR3~0))) (.cse29 (= ~customIrp~0 0)) (.cse22 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse1 (not (= 2 ~DC~0))) (.cse23 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse13 (not (= 7 ~IPC~0))) (.cse15 (not (= ~DeviceUsageTypePaging~0 1))) (.cse27 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse17 (not (= ~Executive~0 0))) (.cse28 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse18 (not (= 1 ~NP~0))) (.cse0 (let ((.cse30 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse31 (or .cse4 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse5 .cse10 .cse25 .cse26 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse30 .cse6 .cse7 .cse31) (or .cse30 .cse9 .cse31)))) (.cse19 (not (= 5 ~MPR1~0))) (.cse20 (not (= ~KernelMode~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0)))) (and (or (= |old(~s~0)| ~s~0) .cse0) (or .cse1 .cse2 (let ((.cse8 (or .cse10 .cse11 .cse12))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse3 .cse4 .cse5 .cse9 .cse8))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= |old(~s~0)| ~MPR3~0)) .cse21) (or .cse22 .cse1 .cse23 .cse2 .cse13 (let ((.cse24 (or .cse5 .cse10 .cse25 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse11 .cse26 .cse12))) (and (or .cse3 .cse6 .cse7 .cse24) (or .cse3 .cse9 .cse24))) .cse14 .cse15 .cse16 .cse27 .cse17 .cse28 (not (= 1 |old(~s~0)|)) .cse18 (and .cse29 (= 1 ~setEventCalled~0) (= ~s~0 |old(~s~0)|)) .cse19 .cse20 .cse21) (or .cse29 (or .cse22 .cse1 .cse23 .cse2 .cse13 .cse15 .cse27 .cse17 .cse28 .cse18 .cse0 .cse19 .cse20 .cse21)))))) [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-12-09 19:26:04,497 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-12-09 19:26:04,498 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse24 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse2 (not (= 2 ~DC~0))) (.cse25 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse14 (not (= 7 ~IPC~0))) (.cse7 (< 0 .cse34)) (.cse8 (< .cse34 0)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (= ~myStatus~0 0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse31 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse32 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse26 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse18 (not (= ~Executive~0 0))) (.cse27 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (let ((.cse0 (= ~customIrp~0 0)) (.cse23 (or .cse24 .cse2 .cse25 .cse3 .cse14 (let ((.cse33 (or .cse6 .cse11 .cse31 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse32 .cse13))) (and (or .cse4 .cse7 .cse8 .cse33) (or .cse4 .cse10 .cse33))) .cse15 .cse16 .cse17 .cse26 .cse18 .cse27 (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)) (.cse28 (let ((.cse29 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse30 (or .cse5 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse11 .cse31 .cse32 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse29 .cse7 .cse8 .cse30) (or .cse29 .cse10 .cse30)))) (.cse1 (= ~s~0 ~NP~0))) (and (or (and .cse0 .cse1) (or .cse2 .cse3 (let ((.cse9 (or .cse11 .cse12 .cse13))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse4 .cse5 .cse6 .cse10 .cse9))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= |old(~s~0)| ~MPR3~0)) .cse22)) (or .cse0 .cse23) (or (or .cse24 .cse2 .cse25 .cse3 .cse14 .cse16 .cse26 .cse18 .cse27 .cse19 .cse28 .cse20 .cse21 .cse22) .cse0) (or (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse23) (or .cse28 .cse1))))) [2018-12-09 19:26:04,498 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-12-09 19:26:04,498 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse24 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse2 (not (= 2 ~DC~0))) (.cse25 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse3 (not (= ~UNLOADED~0 0))) (.cse14 (not (= 7 ~IPC~0))) (.cse7 (< 0 .cse34)) (.cse8 (< .cse34 0)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (= ~myStatus~0 0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse31 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse32 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse26 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse18 (not (= ~Executive~0 0))) (.cse27 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (let ((.cse0 (= ~customIrp~0 0)) (.cse23 (or .cse24 .cse2 .cse25 .cse3 .cse14 (let ((.cse33 (or .cse6 .cse11 .cse31 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse32 .cse13))) (and (or .cse4 .cse7 .cse8 .cse33) (or .cse4 .cse10 .cse33))) .cse15 .cse16 .cse17 .cse26 .cse18 .cse27 (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)) (.cse28 (let ((.cse29 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse30 (or .cse5 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse11 .cse31 .cse32 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse29 .cse7 .cse8 .cse30) (or .cse29 .cse10 .cse30)))) (.cse1 (= ~s~0 ~NP~0))) (and (or (and .cse0 .cse1) (or .cse2 .cse3 (let ((.cse9 (or .cse11 .cse12 .cse13))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse4 .cse5 .cse6 .cse10 .cse9))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= |old(~s~0)| ~MPR3~0)) .cse22)) (or .cse0 .cse23) (or (or .cse24 .cse2 .cse25 .cse3 .cse14 .cse16 .cse26 .cse18 .cse27 .cse19 .cse28 .cse20 .cse21 .cse22) .cse0) (or (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse23) (or .cse28 .cse1))))) [2018-12-09 19:26:04,499 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse26 (+ ~myStatus~0 1073741637)) (.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse24 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse25 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (or .cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse7 .cse11 .cse24 .cse25 (< ~IPC~0 (+ ~DC~0 5)))) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse14 (not (= 7 ~IPC~0))) (.cse8 (< 0 .cse26)) (.cse9 (< .cse26 0)) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~myStatus~0 0))) (.cse12 (< ~compRegistered~0 1)) (.cse13 (not (= 1 ~routine~0))) (.cse15 (not (= ~SKIP2~0 4))) (.cse16 (not (= ~DeviceUsageTypePaging~0 1))) (.cse17 (not (= 6 ~MPR3~0))) (.cse18 (not (= ~Executive~0 0))) (.cse19 (not (= 1 ~NP~0))) (.cse20 (not (= 5 ~MPR1~0))) (.cse21 (not (= ~KernelMode~0 0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (let ((.cse10 (or .cse11 .cse12 .cse13))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse7 .cse1 .cse10))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= |old(~s~0)| ~MPR3~0)) .cse22) (or .cse0 .cse8 .cse9 .cse2) (or (not (= |KeWaitForSingleObject_#in~WaitMode| 0)) .cse3 (not (= |KeWaitForSingleObject_#in~WaitReason| 0)) .cse4 .cse14 (let ((.cse23 (or .cse7 .cse11 .cse24 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse12 .cse25 .cse13))) (and (or .cse5 .cse8 .cse9 .cse23) (or .cse5 .cse1 .cse23))) .cse15 .cse16 .cse17 (not (= |KeWaitForSingleObject_#in~Timeout| 0)) .cse18 (not (= |KeWaitForSingleObject_#in~Alertable| 0)) (not (= 1 |old(~s~0)|)) .cse19 .cse20 .cse21 .cse22)))) [2018-12-09 19:26:04,499 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-12-09 19:26:04,499 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-12-09 19:26:04,499 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-12-09 19:26:04,499 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-12-09 19:26:04,499 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-12-09 19:26:04,499 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse34 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< 0 .cse34)) (.cse9 (< .cse34 0)) (.cse11 (not (= ~myStatus~0 0))) (.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= 0 ~pended~0))) (.cse27 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse28 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse31 (= ~customIrp~0 0)) (.cse0 (= |old(~s~0)| ~s~0))) (let ((.cse2 (and .cse31 (and .cse0 (= 1 ~setEventCalled~0)))) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (< ~compRegistered~0 1)) (.cse14 (not (= 1 ~routine~0))) (.cse16 (not (= ~SKIP2~0 4))) (.cse18 (not (= 6 ~MPR3~0))) (.cse24 (not (= |KeWaitForSingleObject_#in~WaitMode| 0))) (.cse3 (not (= 2 ~DC~0))) (.cse25 (not (= |KeWaitForSingleObject_#in~WaitReason| 0))) (.cse4 (not (= ~UNLOADED~0 0))) (.cse15 (not (= 7 ~IPC~0))) (.cse17 (not (= ~DeviceUsageTypePaging~0 1))) (.cse29 (not (= |KeWaitForSingleObject_#in~Timeout| 0))) (.cse19 (not (= ~Executive~0 0))) (.cse30 (not (= |KeWaitForSingleObject_#in~Alertable| 0))) (.cse20 (not (= 1 ~NP~0))) (.cse1 (let ((.cse32 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse33 (or .cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse7 .cse12 .cse27 .cse28 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse32 .cse8 .cse9 .cse33) (or .cse32 .cse11 .cse33)))) (.cse21 (not (= 5 ~MPR1~0))) (.cse22 (not (= ~KernelMode~0 0))) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or .cse2 (or .cse3 .cse4 (let ((.cse10 (or .cse12 .cse13 .cse14))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse7 .cse11 .cse10))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= |old(~s~0)| ~MPR3~0)) .cse23)) (or .cse2 .cse24 .cse3 .cse25 .cse4 .cse15 (let ((.cse26 (or .cse7 .cse12 .cse27 (< ~SKIP1~0 (+ |old(~s~0)| 2)) .cse13 .cse28 .cse14))) (and (or .cse5 .cse8 .cse9 .cse26) (or .cse5 .cse11 .cse26))) .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 (not (= 1 |old(~s~0)|)) .cse20 .cse21 .cse22 .cse23) (or .cse31 (or .cse24 .cse3 .cse25 .cse4 .cse15 .cse17 .cse29 .cse19 .cse30 .cse20 .cse1 .cse21 .cse22 .cse23)))))) [2018-12-09 19:26:04,500 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2)) (.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (< ~SKIP2~0 .cse14)) (.cse3 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (<= .cse14 ~SKIP2~0))) (.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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-12-09 19:26:04,500 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-12-09 19:26:04,500 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))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse2 (< ~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,500 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-12-09 19:26:04,500 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))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 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)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-12-09 19:26:04,500 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)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (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-12-09 19:26:04,500 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-12-09 19:26:04,501 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)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1)))) (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-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-12-09 19:26:04,501 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))) (.cse6 (= |old(~s~0)| ~s~0)) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3))) .cse6) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse6 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-12-09 19:26:04,501 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-12-09 19:26:04,502 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or .cse5 (not (= ~compRegistered~0 0)))) (or (or (or (or .cse1 .cse5) .cse0 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3))))) [2018-12-09 19:26:04,502 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-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-12-09 19:26:04,502 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-12-09 19:26:04,502 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-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-12-09 19:26:04,502 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-12-09 19:26:04,503 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~pended~0)) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,509 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-12-09 19:26:04,509 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)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse1 0) .cse8 .cse9 .cse10)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-12-09 19:26:04,510 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (let ((.cse1 (+ ~myStatus~0 1073741637))) (or (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)))) (or (and (= ~customIrp~0 0) .cse0) (and (= .cse1 0) .cse0))) (let ((.cse4 (not (= 2 ~DC~0))) (.cse5 (not (= ~UNLOADED~0 0))) (.cse6 (not (= 7 ~IPC~0))) (.cse9 (not (= ~DeviceUsageTypePaging~0 1))) (.cse10 (not (= ~Executive~0 0))) (.cse2 (not (= 1 ~NP~0))) (.cse3 (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (not (= 0 ~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)|))) (.cse20 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse11 .cse12 (< 0 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse1 0) .cse18 .cse19 .cse20) (or .cse11 .cse12 (not (= ~myStatus~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (.cse7 (not (= 5 ~MPR1~0))) (.cse8 (not (= ~KernelMode~0 0)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse1)) .cse7 .cse8 .cse9 .cse10) (or .cse4 .cse5 .cse6 .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 (not (= |old(~customIrp~0)| 0))))))) [2018-12-09 19:26:04,513 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-12-09 19:26:04,514 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-12-09 19:26:04,514 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 (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (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-12-09 19:26:04,514 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-12-09 19:26:04,514 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (and (= ~customIrp~0 0) (not (= CdAudioPnp_~irpSp__MinorFunction~0 0)) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~myStatus~0 |old(~myStatus~0)|))) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-12-09 19:26:04,514 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (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)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-12-09 19:26:04,518 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (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)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 19:26:04,519 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 (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (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-12-09 19:26:04,524 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (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)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 19:26:04,524 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-12-09 19:26:04,524 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-12-09 19:26:04,524 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-09 19:26:04,524 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-12-09 19:26:04,524 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse12 (+ ~SKIP2~0 3)) (.cse14 (+ ~DC~0 2)) (.cse16 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse13 (+ ~SKIP1~0 2)) (.cse11 (+ ~MPR3~0 1))) (let ((.cse17 (and (<= .cse12 ~IPC~0) (and (<= .cse14 ~SKIP2~0) (and (<= .cse16 ~SKIP1~0) (= 0 ~pended~0) (<= .cse15 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse13 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1)) (<= .cse11 ~IPC~0))))) (or (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~0)) (let ((.cse0 (< ~SKIP1~0 .cse16)) (.cse1 (< ~MPR3~0 .cse15)) (.cse3 (< ~SKIP2~0 .cse14)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse13)) (.cse7 (< ~IPC~0 .cse12)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse11))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0))) (and (= |old(~myStatus~0)| ~myStatus~0) .cse17 (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (and (= 0 CdAudioPnp_~status~2) .cse17)))) [2018-12-09 19:26:04,529 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-12-09 19:26:04,529 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-12-09 19:26:04,529 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 (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (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-12-09 19:26:04,529 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (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)|))) (or (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 19:26:04,530 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 (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (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-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-12-09 19:26:04,533 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-12-09 19:26:04,533 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 (= ~Executive~0 0)) (not (= 1 ~NP~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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= 5 ~MPR1~0)) (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-12-09 19:26:04,533 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-12-09 19:26:04,534 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-12-09 19:26:04,534 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-12-09 19:26:04,534 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-12-09 19:26:04,534 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-12-09 19:26:04,534 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-12-09 19:26:04,534 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-12-09 19:26:04,534 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-12-09 19:26:04,539 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-12-09 19:26:04,539 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,539 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-12-09 19:26:04,539 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-12-09 19:26:04,539 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-12-09 19:26:04,539 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,540 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-12-09 19:26:04,540 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-12-09 19:26:04,540 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-12-09 19:26:04,540 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,540 INFO L444 ceAbstractionStarter]: At program point L764(line 764) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2018-12-09 19:26:04,549 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-12-09 19:26:04,549 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-12-09 19:26:04,549 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-12-09 19:26:04,549 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-12-09 19:26:04,549 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,550 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2018-12-09 19:26:04,550 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,550 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-12-09 19:26:04,550 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-12-09 19:26:04,550 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-12-09 19:26:04,561 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L444 ceAbstractionStarter]: At program point L702(line 702) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-12-09 19:26:04,561 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-12-09 19:26:04,561 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-12-09 19:26:04,561 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,575 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-12-09 19:26:04,575 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse11 0)))) [2018-12-09 19:26:04,575 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-12-09 19:26:04,575 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-12-09 19:26:04,576 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,576 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-12-09 19:26:04,576 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-12-09 19:26:04,576 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-12-09 19:26:04,576 INFO L444 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (and (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .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)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10 .cse11)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-09 19:26:04,585 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,585 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-12-09 19:26:04,586 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-12-09 19:26:04,586 INFO L444 ceAbstractionStarter]: At program point L756(line 756) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse11) (<= .cse11 0)))) [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-12-09 19:26:04,588 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-12-09 19:26:04,588 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-12-09 19:26:04,591 INFO L444 ceAbstractionStarter]: At program point L709(line 709) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-12-09 19:26:04,591 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-12-09 19:26:04,591 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-12-09 19:26:04,592 INFO L444 ceAbstractionStarter]: At program point L727(line 727) 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~myStatus~0) (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse11 0))))) [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-12-09 19:26:04,598 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-12-09 19:26:04,598 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,604 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,604 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-12-09 19:26:04,604 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-12-09 19:26:04,604 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-12-09 19:26:04,615 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-12-09 19:26:04,615 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-12-09 19:26:04,616 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse15 (= 0 ~pended~0)) (.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse16)) (.cse9 (< .cse16 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (and .cse15 (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse9 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) .cse2 (not (= ~DeviceUsageTypePaging~0 1)) (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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11 (and .cse15 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse13 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,616 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-12-09 19:26:04,616 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-12-09 19:26:04,616 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-12-09 19:26:04,616 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-12-09 19:26:04,616 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,626 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-12-09 19:26:04,626 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-12-09 19:26:04,626 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-12-09 19:26:04,626 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-12-09 19:26:04,626 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or (let ((.cse13 (or .cse8 (not (= 1 ~routine~0)) .cse3 .cse5 .cse11))) (and (or .cse12 .cse13) (or .cse7 .cse10 .cse13))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11)))) [2018-12-09 19:26:04,626 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-12-09 19:26:04,626 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse15 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse15)) (.cse9 (< .cse15 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse14 (or .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse12))) (and (or .cse13 .cse14) (or .cse1 .cse9 .cse14))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 .cse0 .cse13 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,631 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-12-09 19:26:04,631 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse22 (+ ~MPR3~0 1)) (.cse18 (+ ~SKIP2~0 3)) (.cse19 (+ ~SKIP1~0 2)) (.cse21 (+ ~DC~0 2)) (.cse20 (+ ~NP~0 5)) (.cse23 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse23)) (.cse8 (< .cse23 0)) (.cse14 (= 0 ~pended~0)) (.cse0 (< ~MPR3~0 .cse20)) (.cse16 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse21)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse19)) (.cse7 (< ~IPC~0 .cse18)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 .cse22)) (.cse11 (and (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (= ~routine~0 0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (<= .cse22 ~IPC~0))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse13 0) .cse14 (<= 0 .cse13) (= ~MPR1~0 ~s~0) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (or (let ((.cse17 (or .cse2 (not (= 1 ~routine~0)) .cse6 .cse9 .cse12))) (and (or .cse16 .cse17) (or .cse1 .cse8 .cse17))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (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 (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 .cse6 .cse7 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse9 .cse10 (and .cse14 (= ~s~0 ~SKIP1~0))) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))) [2018-12-09 19:26:04,631 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 .cse16)) (.cse10 (< .cse16 0)) (.cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse11) (or (let ((.cse13 (or .cse8 (not (= 1 ~routine~0)) .cse3 .cse5 .cse11))) (and (or .cse12 .cse13) (or .cse7 .cse10 .cse13))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (not (= ~DeviceUsageTypePaging~0 1)) (not (= 6 ~MPR3~0)) (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse14 0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse14) (<= .cse15 0) (= 1 ~setEventCalled~0) (<= 0 .cse15))) (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)))))) [2018-12-09 19:26:04,637 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse9 (< 0 .cse14)) (.cse10 (< .cse14 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (not (= ~myStatus~0 0))) (.cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= 0 |old(~pended~0)|))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 (< ~SKIP1~0 |old(~s~0)|) .cse2 .cse3 .cse4 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse5 .cse6) (or (let ((.cse8 (or .cse11 (not (= 1 ~routine~0)) .cse3 .cse5 .cse12))) (and (or .cse7 .cse8) (or .cse9 .cse10 .cse8))) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= ~SKIP2~0 4)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= ~DeviceUsageTypePaging~0 1)) (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 .cse0 .cse9 .cse11 .cse1 .cse2 .cse13 .cse3 .cse4 .cse10 .cse5 .cse6 .cse12) (or .cse0 .cse7 .cse11 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse12)))) [2018-12-09 19:26:04,638 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-12-09 19:26:04,638 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-12-09 19:26:04,638 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-12-09 19:26:04,638 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-12-09 19:26:04,638 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-12-09 19:26:04,641 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-09 19:26:04,641 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-12-09 19:26:04,641 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-12-09 19:26:04,641 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:26:04,642 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-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~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)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-12-09 19:26:04,642 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)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~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)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-09 19:26:04,642 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-12-09 19:26:04,646 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)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~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)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,646 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) (= 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-12-09 19:26:04,646 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse11 (+ ~NP~0 5))) (let ((.cse12 (and (= 0 ~pended~0) (<= .cse11 ~MPR3~0))) (.cse14 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse13 (= ~routine~0 0)) (.cse15 (= ~IPC~0 ~s~0))) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse11)) (.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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse12 .cse13)) (and .cse14 (<= 1 ~compRegistered~0) .cse15 .cse13) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse12 .cse13 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and .cse12 .cse14 .cse13 .cse15)))) [2018-12-09 19:26:04,655 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,655 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-12-09 19:26:04,655 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-12-09 19:26:04,655 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,655 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-12-09 19:26:04,655 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-12-09 19:26:04,655 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,662 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-09 19:26:04,663 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,663 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)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-09 19:26:04,663 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-12-09 19:26:04,663 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-12-09 19:26:04,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:26:04,663 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-12-09 19:26:04,663 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:26:04,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:26:04,663 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-12-09 19:26:04,669 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-12-09 19:26:04,669 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)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-12-09 19:26:04,669 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-12-09 19:26:04,669 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-12-09 19:26:04,670 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-12-09 19:26:04,670 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-12-09 19:26:04,670 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-12-09 19:26:04,678 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-12-09 19:26:04,679 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0)) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-09 19:26:04,686 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-12-09 19:26:04,686 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-12-09 19:26:04,687 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)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,687 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-12-09 19:26:04,687 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-12-09 19:26:04,687 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,687 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,687 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0))) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-12-09 19:26:04,687 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-12-09 19:26:04,687 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-12-09 19:26:04,687 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-09 19:26:04,696 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)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,696 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-12-09 19:26:04,696 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-12-09 19:26:04,696 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-12-09 19:26:04,696 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-12-09 19:26:04,696 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-12-09 19:26:04,697 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-09 19:26:04,697 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-12-09 19:26:04,697 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-12-09 19:26:04,697 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-12-09 19:26:04,697 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,697 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-12-09 19:26:04,706 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)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (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-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-12-09 19:26:04,706 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-12-09 19:26:04,707 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-12-09 19:26:04,707 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-12-09 19:26:04,707 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-12-09 19:26:04,707 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-12-09 19:26:04,707 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,714 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-12-09 19:26:04,714 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-12-09 19:26:04,714 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-12-09 19:26:04,714 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-12-09 19:26:04,714 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,714 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-12-09 19:26:04,714 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-12-09 19:26:04,714 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-09 19:26:04,715 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-12-09 19:26:04,715 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,715 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-12-09 19:26:04,715 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)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,721 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-12-09 19:26:04,722 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (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-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-12-09 19:26:04,727 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6))) [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-12-09 19:26:04,733 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)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-12-09 19:26:04,733 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-12-09 19:26:04,734 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-12-09 19:26:04,734 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-12-09 19:26:04,734 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (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 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-12-09 19:26:04,734 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-12-09 19:26:04,734 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-12-09 19:26:04,734 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-12-09 19:26:04,734 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-12-09 19:26:04,738 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0))) (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))))) (not (= ~Executive~0 0))) [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse5 (not (= 1 ~NP~0))) (.cse0 (not (= 2 ~DC~0))) (.cse1 (not (= ~UNLOADED~0 0))) (.cse2 (not (= 7 ~IPC~0))) (.cse6 (not (= 5 ~MPR1~0))) (.cse7 (not (= ~KernelMode~0 0))) (.cse3 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (let ((.cse9 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse9 .cse10 (not (= ~myStatus~0 0))) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse9 .cse10 (< 0 .cse11) (< .cse11 0)))))) (.cse4 (not (= ~Executive~0 0)))) (and (or .cse0 .cse1 .cse2 (= ~customIrp~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~customIrp~0)| 0))) (or .cse5 .cse0 .cse1 .cse2 .cse6 .cse7 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse3 .cse8 .cse4))) [2018-12-09 19:26:04,739 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-12-09 19:26:04,739 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse1 (not (= 2 ~DC~0))) (.cse2 (not (= ~UNLOADED~0 0))) (.cse3 (not (= 7 ~IPC~0))) (.cse6 (not (= ~DeviceUsageTypePaging~0 1))) (.cse8 (not (= ~Executive~0 0))) (.cse0 (not (= 1 ~NP~0))) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= ~KernelMode~0 0))) (.cse7 (let ((.cse9 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse9 .cse10 (not (= ~myStatus~0 0))) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse9 .cse10 (< 0 .cse11) (< .cse11 0))))))) (and (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse6 (= ~customIrp~0 0) .cse8 .cse0 .cse4 .cse5 .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-12-09 19:26:04,743 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (not (= 1 ~NP~0)) (not (= 2 ~DC~0)) (not (= ~UNLOADED~0 0)) (not (= 7 ~IPC~0)) (not (= 5 ~MPR1~0)) (not (= ~KernelMode~0 0)) (not (= ~DeviceUsageTypePaging~0 1)) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0))) (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) (< .cse2 0))))) (not (= ~Executive~0 0))) [2018-12-09 19:26:04,743 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-12-09 19:26:04,743 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-12-09 19:26:04,743 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse5 (not (= 2 ~DC~0))) (.cse6 (not (= ~UNLOADED~0 0))) (.cse7 (not (= 7 ~IPC~0))) (.cse8 (not (= ~DeviceUsageTypePaging~0 1))) (.cse9 (not (= ~Executive~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 5 ~MPR1~0))) (.cse12 (not (= ~KernelMode~0 0))) (.cse13 (let ((.cse14 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (.cse15 (< ~IPC~0 (+ ~SKIP2~0 3)))) (and (or .cse14 .cse15 (not (= ~myStatus~0 0))) (let ((.cse16 (+ ~myStatus~0 1073741637))) (or .cse14 .cse15 (< 0 .cse16) (< .cse16 0))))))) (and (let ((.cse0 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= 1 ~compRegistered~0)) (.cse4 (= 1 ~setEventCalled~0)) (.cse3 (= ~routine~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (= ~s~0 ~MPR3~0)) .cse5 .cse6 (and .cse0 .cse1 (= |old(~s~0)| ~s~0) .cse2 .cse4 .cse3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse5 .cse6 .cse7 .cse8 (= ~customIrp~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~customIrp~0)| 0))))) [2018-12-09 19:26:04,743 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-12-09 19:26:04,743 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-12-09 19:26:04,743 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-12-09 19:26:04,743 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-12-09 19:26:04,743 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-12-09 19:26:04,749 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-12-09 19:26:04,749 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-12-09 19:26:04,749 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-12-09 19:26:04,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:26:04 BoogieIcfgContainer [2018-12-09 19:26:04,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:26:04,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:26:04,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:26:04,798 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:26:04,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:24:50" (3/4) ... [2018-12-09 19:26:04,801 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:26:04,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-12-09 19:26:04,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-12-09 19:26:04,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-12-09 19:26:04,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-12-09 19:26:04,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-12-09 19:26:04,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-12-09 19:26:04,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-09 19:26:04,827 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-12-09 19:26:04,828 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-09 19:26:04,830 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 19:26:04,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status)) || (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\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)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-09 19:26:04,857 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))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-09 19:26:04,858 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))) || ((((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) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((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) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-12-09 19:26:04,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-09 19:26:04,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((customIrp == 0 && s == NP) || (((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (customIrp == 0 || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && ((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP) [2018-12-09 19:26:04,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((customIrp == 0 && s == NP) || (((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (customIrp == 0 || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && ((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP) [2018-12-09 19:26:04,859 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-12-09 19:26:04,860 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) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || !(\old(myStatus) == 0)) || ((((((((((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) && MPR3 + 1 <= IPC)) || !(\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-12-09 19:26:04,860 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-12-09 19:26:04,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-09 19:26:04,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\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)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\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-12-09 19:26:04,860 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) [2018-12-09 19:26:04,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(s) == s || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || ((customIrp == 0 && 1 == setEventCalled) && s == \old(s))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) [2018-12-09 19:26:04,861 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-12-09 19:26:04,861 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-12-09 19:26:04,862 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))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && Executive == 0) && DC == 2) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && ((((((((((((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) && MPR3 + 1 <= IPC) || ((((((((((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) && MPR3 + 1 <= IPC)))) || !(\old(s) == \old(IPC)) [2018-12-09 19:26:04,862 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-09 19:26:04,862 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) [2018-12-09 19:26:04,875 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-12-09 19:26:04,876 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,885 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,886 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) [2018-12-09 19:26:04,886 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,886 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((!(1 == NP) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(2 == DC)) || !(UNLOADED == 0)) || (((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) [2018-12-09 19:26:04,903 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) [2018-12-09 19:26:04,903 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) [2018-12-09 19:26:04,903 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-12-09 19:26:04,903 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((customIrp == 0 || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((!(1 == NP) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) [2018-12-09 19:26:04,920 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) [2018-12-09 19:26:04,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) [2018-12-09 19:26:04,938 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-12-09 19:26:04,940 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-09 19:26:04,940 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-12-09 19:26:04,940 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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-09 19:26:04,940 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,950 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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 [2018-12-09 19:26:04,950 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,950 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-09 19:26:04,950 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,951 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-09 19:26:04,951 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-09 19:26:04,961 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) [2018-12-09 19:26:04,961 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,961 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:04,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-09 19:26:04,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-09 19:26:04,990 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) [2018-12-09 19:26:05,085 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68b501cc-09ec-4e22-9852-03b80ffbc104/bin-2019/utaipan/witness.graphml [2018-12-09 19:26:05,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:26:05,085 INFO L168 Benchmark]: Toolchain (without parser) took 75278.32 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 753.4 MB). Free memory was 947.0 MB in the beginning and 1.7 GB in the end (delta: -771.0 MB). Peak memory consumption was 935.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,086 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:05,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:05,087 INFO L168 Benchmark]: Boogie Preprocessor took 41.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,087 INFO L168 Benchmark]: RCFGBuilder took 741.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.9 MB in the end (delta: 139.9 MB). Peak memory consumption was 139.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,087 INFO L168 Benchmark]: TraceAbstraction took 73832.50 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 667.9 MB). Free memory was 942.9 MB in the beginning and 830.2 MB in the end (delta: 112.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,087 INFO L168 Benchmark]: Witness Printer took 287.18 ms. Allocated memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: -23.1 MB). Free memory was 830.2 MB in the beginning and 1.7 GB in the end (delta: -887.8 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:05,089 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 741.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.9 MB in the end (delta: 139.9 MB). Peak memory consumption was 139.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73832.50 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 667.9 MB). Free memory was 942.9 MB in the beginning and 830.2 MB in the end (delta: 112.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 287.18 ms. Allocated memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: -23.1 MB). Free memory was 830.2 MB in the beginning and 1.7 GB in the end (delta: -887.8 MB). Peak memory consumption was 42.5 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: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\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)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((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)) || (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\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)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((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: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 634]: 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((customIrp == 0 && s == NP) || (((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (customIrp == 0 || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && ((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((customIrp == 0 || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((!(1 == NP) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(5 == MPR1)) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) - InvariantResult [Line: 605]: 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((customIrp == 0 && s == NP) || (((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (customIrp == 0 || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && ((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || customIrp == 0)) && ((\old(s) == s && 1 == setEventCalled) || (((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(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))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5)) || s == NP) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || customIrp == 0) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(0 == myStatus + 1073741637)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) && (((((((((!(1 == NP) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(2 == DC)) || !(UNLOADED == 0)) || (((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1)) || !(7 == IPC)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(DeviceUsageTypePaging == 1)) || !(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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: 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))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((((((customIrp == 0 && UNLOADED == 0) && MPR1 == 5) && IPC == 7) && Executive == 0) && DC == 2) && NP == 1) && DeviceUsageTypePaging == 1) && KernelMode == 0) && ((((((((((((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) && MPR3 + 1 <= IPC) || ((((((((((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) && MPR3 + 1 <= IPC)))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((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)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((\old(s) == s || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) && ((((((((((((!(2 == DC) || !(UNLOADED == 0)) || ((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)) && ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || (!(0 == pended) || compRegistered < 1) || !(1 == routine)))) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (((((((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || ((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) && ((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || (((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)))) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == \old(s))) || !(1 == NP)) || ((customIrp == 0 && 1 == setEventCalled) && s == \old(s))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0))) && (customIrp == 0 || ((((((((((((!(\old(WaitMode) == 0) || !(2 == DC)) || !(\old(WaitReason) == 0)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(\old(Timeout) == 0)) || !(Executive == 0)) || !(\old(Alertable) == 0)) || !(1 == NP)) || ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) && ((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5))) || !(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))) || ((((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) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((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) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || compRegistered < 1) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || (((((((((((((!(myStatus == 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1) && ((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || (((SKIP1 < \old(s) + 2 || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || compRegistered < 1)) || !(2 == DC)) || !(UNLOADED == 0)) || !(7 == IPC)) || !(SKIP2 == 4)) || !(DeviceUsageTypePaging == 1)) || !(6 == MPR3)) || !(Executive == 0)) || !(1 == \old(s))) || !(1 == NP)) || !(5 == MPR1)) || !(KernelMode == 0)) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == SKIP1))) && (((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((((((SKIP2 + 3 <= IPC && \old(s) == s) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == \old(s)) && s + 2 <= SKIP1) && MPR3 + 1 <= IPC)) || 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 329]: 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(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: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode) || ((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((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) && MPR3 + 1 <= IPC) || !(\old(myStatus) == 0)) || ((((((((((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) && MPR3 + 1 <= IPC)) || !(\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: 1113]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((0 <= status + 1073741670 && s == NP && 0 == pended) && myStatus == \old(myStatus)) && 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 319]: 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(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))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((customIrp == 0 && !(irpSp__MinorFunction == 0)) && (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || ((((((((!(2 == DC) || !(UNLOADED == 0)) || !(7 == IPC)) || !(DeviceUsageTypePaging == 1)) || !(Executive == 0)) || !(1 == NP)) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1))) || !(5 == MPR1)) || !(KernelMode == 0)) || !(\old(customIrp) == 0) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((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))) || IPC < MPR3 + 1) && ((((((((((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))) || IPC < MPR3 + 1)) - 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, 73.7s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 47.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 50410 SDtfs, 20006 SDslu, 223731 SDs, 0 SdLazy, 21314 SolverSat, 3278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1173 GetRequests, 422 SyntacticMatches, 8 SemanticMatches, 743 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=15, 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.1s AutomataMinimizationTime, 96 MinimizatonAttempts, 2746 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1815 PreInvPairs, 2182 NumberOfFragments, 25738 HoareAnnotationTreeSize, 1815 FomulaSimplifications, 62257831 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1782962 FormulaSimplificationTreeSizeReductionInter, 45.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 6342 NumberOfCodeBlocks, 6342 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 6246 ConstructedInterpolants, 0 QuantifiedInterpolants, 881974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 94 PerfectInterpolantSequences, 65/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...