./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_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/config/AutomizerReach.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_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer --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 Automizer --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-02 06:27:02,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:27:02,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:27:02,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:27:02,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:27:02,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:27:02,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:27:02,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:27:02,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:27:02,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:27:02,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:27:02,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:27:02,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:27:02,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:27:02,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:27:02,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:27:02,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:27:02,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:27:02,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:27:02,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:27:02,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:27:02,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:27:02,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:27:02,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:27:02,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:27:02,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:27:02,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:27:02,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:27:02,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:27:02,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:27:02,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:27:02,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:27:02,403 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:27:02,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:27:02,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:27:02,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:27:02,404 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 06:27:02,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:27:02,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:27:02,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:27:02,412 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:27:02,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:27:02,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:27:02,412 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:27:02,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:27:02,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:27:02,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:27:02,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:27:02,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer 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 -> Automizer 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-02 06:27:02,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:27:02,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:27:02,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:27:02,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:27:02,441 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:27:02,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 06:27:02,477 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/data/4533c9203/5479452202484af9b212481070f61f3b/FLAG71f3d218c [2018-12-02 06:27:02,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:27:02,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 06:27:02,867 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/data/4533c9203/5479452202484af9b212481070f61f3b/FLAG71f3d218c [2018-12-02 06:27:03,218 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/data/4533c9203/5479452202484af9b212481070f61f3b [2018-12-02 06:27:03,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:27:03,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:27:03,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:27:03,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:27:03,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:27:03,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7080f9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03, skipping insertion in model container [2018-12-02 06:27:03,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:27:03,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:27:03,449 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:27:03,452 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:27:03,565 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:27:03,582 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:27:03,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03 WrapperNode [2018-12-02 06:27:03,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:27:03,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:27:03,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:27:03,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:27:03,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:27:03,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:27:03,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:27:03,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:27:03,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... [2018-12-02 06:27:03,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:27:03,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:27:03,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:27:03,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:27:03,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/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-02 06:27:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-02 06:27:03,696 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-02 06:27:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-02 06:27:03,696 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-02 06:27:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-02 06:27:03,696 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-02 06:27:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-02 06:27:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-02 06:27:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:27:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:27:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-02 06:27:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-02 06:27:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-02 06:27:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-02 06:27:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-02 06:27:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-02 06:27:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-02 06:27:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-02 06:27:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-02 06:27:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-02 06:27:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-02 06:27:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-02 06:27:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-02 06:27:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-02 06:27:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-02 06:27:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-02 06:27:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-02 06:27:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-02 06:27:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-02 06:27:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-02 06:27:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-02 06:27:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-02 06:27:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-02 06:27:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-02 06:27:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-02 06:27:03,699 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-02 06:27:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-02 06:27:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-02 06:27:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-02 06:27:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-02 06:27:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-02 06:27:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-02 06:27:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-02 06:27:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-02 06:27:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:27:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:27:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-02 06:27:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-02 06:27:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-02 06:27:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-02 06:27:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:27:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:27:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-02 06:27:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-02 06:27:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-02 06:27:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-02 06:27:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-02 06:27:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-02 06:27:03,702 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-02 06:27:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-02 06:27:03,917 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:03,917 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:03,970 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:03,970 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,018 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,018 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,057 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,057 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,083 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,084 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,180 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,180 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,215 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,216 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,230 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,230 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,360 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:27:04,360 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:27:04,370 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:27:04,371 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 06:27:04,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:27:04 BoogieIcfgContainer [2018-12-02 06:27:04,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:27:04,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:27:04,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:27:04,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:27:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:27:03" (1/3) ... [2018-12-02 06:27:04,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbeef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:27:04, skipping insertion in model container [2018-12-02 06:27:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:27:03" (2/3) ... [2018-12-02 06:27:04,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbeef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:27:04, skipping insertion in model container [2018-12-02 06:27:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:27:04" (3/3) ... [2018-12-02 06:27:04,375 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 06:27:04,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:27:04,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 06:27:04,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 06:27:04,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:27:04,418 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:27:04,418 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:27:04,418 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:27:04,418 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:27:04,418 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:27:04,418 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:27:04,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:27:04,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:27:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2018-12-02 06:27:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 06:27:04,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:04,441 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-02 06:27:04,442 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:04,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2018-12-02 06:27:04,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:04,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27: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-02 06:27:04,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:04,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:04,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:04,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:04,589 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2018-12-02 06:27:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:04,701 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2018-12-02 06:27:04,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:04,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 06:27:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:04,711 INFO L225 Difference]: With dead ends: 887 [2018-12-02 06:27:04,711 INFO L226 Difference]: Without dead ends: 507 [2018-12-02 06:27:04,715 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-02 06:27:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-02 06:27:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-12-02 06:27:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-12-02 06:27:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2018-12-02 06:27:04,765 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2018-12-02 06:27:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:04,765 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2018-12-02 06:27:04,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2018-12-02 06:27:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 06:27:04,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:04,766 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-02 06:27:04,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:04,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2018-12-02 06:27:04,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:04,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:04,835 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-02 06:27:04,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:04,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:04,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:04,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:04,837 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2018-12-02 06:27:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:04,984 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2018-12-02 06:27:04,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:04,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 06:27:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:04,989 INFO L225 Difference]: With dead ends: 789 [2018-12-02 06:27:04,989 INFO L226 Difference]: Without dead ends: 670 [2018-12-02 06:27:04,990 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-02 06:27:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-02 06:27:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2018-12-02 06:27:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-02 06:27:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2018-12-02 06:27:05,012 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2018-12-02 06:27:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:05,013 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2018-12-02 06:27:05,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2018-12-02 06:27:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 06:27:05,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:05,014 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-02 06:27:05,014 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:05,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1491411356, now seen corresponding path program 1 times [2018-12-02 06:27:05,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:05,052 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-02 06:27:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:05,053 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2018-12-02 06:27:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:05,086 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2018-12-02 06:27:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:05,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 06:27:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:05,090 INFO L225 Difference]: With dead ends: 995 [2018-12-02 06:27:05,091 INFO L226 Difference]: Without dead ends: 819 [2018-12-02 06:27:05,091 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-02 06:27:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-02 06:27:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2018-12-02 06:27:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-02 06:27:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2018-12-02 06:27:05,128 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2018-12-02 06:27:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:05,129 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2018-12-02 06:27:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2018-12-02 06:27:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 06:27:05,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:05,131 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-02 06:27:05,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:05,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1315443348, now seen corresponding path program 1 times [2018-12-02 06:27:05,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:05,170 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-02 06:27:05,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:05,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:05,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:05,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:05,172 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2018-12-02 06:27:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:05,313 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2018-12-02 06:27:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:05,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 06:27:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:05,318 INFO L225 Difference]: With dead ends: 1424 [2018-12-02 06:27:05,318 INFO L226 Difference]: Without dead ends: 1160 [2018-12-02 06:27:05,319 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-02 06:27:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-12-02 06:27:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2018-12-02 06:27:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-02 06:27:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2018-12-02 06:27:05,352 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2018-12-02 06:27:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:05,353 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2018-12-02 06:27:05,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2018-12-02 06:27:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 06:27:05,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:05,355 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-02 06:27:05,355 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:05,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1932537431, now seen corresponding path program 1 times [2018-12-02 06:27:05,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:05,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:05,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:05,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:05,412 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-02 06:27:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:05,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:05,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:05,413 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2018-12-02 06:27:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:05,943 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2018-12-02 06:27:05,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:05,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-02 06:27:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:05,948 INFO L225 Difference]: With dead ends: 1562 [2018-12-02 06:27:05,948 INFO L226 Difference]: Without dead ends: 984 [2018-12-02 06:27:05,950 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-02 06:27:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-02 06:27:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2018-12-02 06:27:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-02 06:27:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2018-12-02 06:27:05,992 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2018-12-02 06:27:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:05,992 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2018-12-02 06:27:05,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2018-12-02 06:27:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 06:27:05,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:05,993 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-02 06:27:05,993 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:05,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash -487494679, now seen corresponding path program 1 times [2018-12-02 06:27:05,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,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-02 06:27:06,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,025 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2018-12-02 06:27:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,086 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2018-12-02 06:27:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 06:27:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,089 INFO L225 Difference]: With dead ends: 890 [2018-12-02 06:27:06,089 INFO L226 Difference]: Without dead ends: 886 [2018-12-02 06:27:06,090 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-02 06:27:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-12-02 06:27:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-12-02 06:27:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-02 06:27:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2018-12-02 06:27:06,114 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2018-12-02 06:27:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,115 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2018-12-02 06:27:06,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2018-12-02 06:27:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 06:27:06,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,116 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-02 06:27:06,116 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1261036943, now seen corresponding path program 1 times [2018-12-02 06:27:06,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,147 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-02 06:27:06,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,148 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2018-12-02 06:27:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,195 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2018-12-02 06:27:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 06:27:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,200 INFO L225 Difference]: With dead ends: 1274 [2018-12-02 06:27:06,200 INFO L226 Difference]: Without dead ends: 1015 [2018-12-02 06:27:06,201 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-02 06:27:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-02 06:27:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2018-12-02 06:27:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-02 06:27:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2018-12-02 06:27:06,229 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2018-12-02 06:27:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,229 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2018-12-02 06:27:06,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2018-12-02 06:27:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 06:27:06,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,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] [2018-12-02 06:27:06,230 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2018-12-02 06:27:06,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,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-02 06:27:06,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,264 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2018-12-02 06:27:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,307 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2018-12-02 06:27:06,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-02 06:27:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,309 INFO L225 Difference]: With dead ends: 972 [2018-12-02 06:27:06,310 INFO L226 Difference]: Without dead ends: 954 [2018-12-02 06:27:06,310 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-02 06:27:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-02 06:27:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2018-12-02 06:27:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-02 06:27:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2018-12-02 06:27:06,335 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2018-12-02 06:27:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,336 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2018-12-02 06:27:06,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2018-12-02 06:27:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:27:06,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,337 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-02 06:27:06,337 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1159920127, now seen corresponding path program 1 times [2018-12-02 06:27:06,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,361 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-02 06:27:06,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,362 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2018-12-02 06:27:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,414 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2018-12-02 06:27:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 06:27:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,419 INFO L225 Difference]: With dead ends: 1167 [2018-12-02 06:27:06,419 INFO L226 Difference]: Without dead ends: 925 [2018-12-02 06:27:06,420 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-02 06:27:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-02 06:27:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2018-12-02 06:27:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-02 06:27:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2018-12-02 06:27:06,468 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2018-12-02 06:27:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,468 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2018-12-02 06:27:06,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2018-12-02 06:27:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:27:06,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,470 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-02 06:27:06,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash -256141125, now seen corresponding path program 1 times [2018-12-02 06:27:06,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,502 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-02 06:27:06,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:06,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:06,503 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2018-12-02 06:27:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,754 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2018-12-02 06:27:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:27:06,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 06:27:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,756 INFO L225 Difference]: With dead ends: 1014 [2018-12-02 06:27:06,757 INFO L226 Difference]: Without dead ends: 785 [2018-12-02 06:27:06,757 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-02 06:27:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-12-02 06:27:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2018-12-02 06:27:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-02 06:27:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2018-12-02 06:27:06,779 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2018-12-02 06:27:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,779 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2018-12-02 06:27:06,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2018-12-02 06:27:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:27:06,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,780 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-02 06:27:06,780 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2018-12-02 06:27:06,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,800 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-02 06:27:06,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,801 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2018-12-02 06:27:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,835 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2018-12-02 06:27:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 06:27:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,838 INFO L225 Difference]: With dead ends: 871 [2018-12-02 06:27:06,838 INFO L226 Difference]: Without dead ends: 775 [2018-12-02 06:27:06,839 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-02 06:27:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-12-02 06:27:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2018-12-02 06:27:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-12-02 06:27:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2018-12-02 06:27:06,875 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2018-12-02 06:27:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:06,875 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2018-12-02 06:27:06,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2018-12-02 06:27:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 06:27:06,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:06,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:06,877 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:06,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2018-12-02 06:27:06,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:06,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:06,904 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-02 06:27:06,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:06,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:06,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:06,905 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2018-12-02 06:27:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:06,978 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2018-12-02 06:27:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:06,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 06:27:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:06,980 INFO L225 Difference]: With dead ends: 938 [2018-12-02 06:27:06,980 INFO L226 Difference]: Without dead ends: 928 [2018-12-02 06:27:06,981 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-02 06:27:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-12-02 06:27:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2018-12-02 06:27:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-02 06:27:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2018-12-02 06:27:07,006 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2018-12-02 06:27:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:07,006 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2018-12-02 06:27:07,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2018-12-02 06:27:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:27:07,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:07,008 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-02 06:27:07,008 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:07,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2018-12-02 06:27:07,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:07,056 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-02 06:27:07,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:07,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:27:07,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:27:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:27:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:27:07,057 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2018-12-02 06:27:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:07,155 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2018-12-02 06:27:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:27:07,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 06:27:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:07,157 INFO L225 Difference]: With dead ends: 851 [2018-12-02 06:27:07,157 INFO L226 Difference]: Without dead ends: 847 [2018-12-02 06:27:07,157 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-02 06:27:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-02 06:27:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2018-12-02 06:27:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-02 06:27:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2018-12-02 06:27:07,186 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2018-12-02 06:27:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:07,186 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2018-12-02 06:27:07,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:27:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2018-12-02 06:27:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:27:07,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:07,187 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-02 06:27:07,188 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:07,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2018-12-02 06:27:07,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:07,230 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-02 06:27:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:07,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:27:07,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:27:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:27:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:27:07,230 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2018-12-02 06:27:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:07,302 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2018-12-02 06:27:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:27:07,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 06:27:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:07,305 INFO L225 Difference]: With dead ends: 886 [2018-12-02 06:27:07,305 INFO L226 Difference]: Without dead ends: 865 [2018-12-02 06:27:07,305 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-02 06:27:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-02 06:27:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2018-12-02 06:27:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-02 06:27:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2018-12-02 06:27:07,333 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2018-12-02 06:27:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:07,333 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2018-12-02 06:27:07,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:27:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2018-12-02 06:27:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 06:27:07,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:07,335 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-02 06:27:07,335 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:07,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2018-12-02 06:27:07,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:07,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:07,356 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-02 06:27:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:07,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:07,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:07,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:07,357 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2018-12-02 06:27:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:07,440 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2018-12-02 06:27:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:07,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 06:27:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:07,443 INFO L225 Difference]: With dead ends: 1081 [2018-12-02 06:27:07,443 INFO L226 Difference]: Without dead ends: 1049 [2018-12-02 06:27:07,444 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-02 06:27:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-02 06:27:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2018-12-02 06:27:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-02 06:27:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2018-12-02 06:27:07,474 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2018-12-02 06:27:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2018-12-02 06:27:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2018-12-02 06:27:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 06:27:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:07,476 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-02 06:27:07,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2018-12-02 06:27:07,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:07,495 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-02 06:27:07,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:07,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:07,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:07,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:07,496 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2018-12-02 06:27:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:07,540 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2018-12-02 06:27:07,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:27:07,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 06:27:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:07,543 INFO L225 Difference]: With dead ends: 966 [2018-12-02 06:27:07,543 INFO L226 Difference]: Without dead ends: 944 [2018-12-02 06:27:07,544 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-02 06:27:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-12-02 06:27:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2018-12-02 06:27:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-02 06:27:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2018-12-02 06:27:07,573 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2018-12-02 06:27:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:07,573 INFO L480 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2018-12-02 06:27:07,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2018-12-02 06:27:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 06:27:07,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:07,575 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-02 06:27:07,575 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:07,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2018-12-02 06:27:07,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:07,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:07,610 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-02 06:27:07,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:07,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:07,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:07,611 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2018-12-02 06:27:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:08,295 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2018-12-02 06:27:08,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:08,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-02 06:27:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:08,300 INFO L225 Difference]: With dead ends: 1110 [2018-12-02 06:27:08,300 INFO L226 Difference]: Without dead ends: 1016 [2018-12-02 06:27:08,301 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-02 06:27:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-12-02 06:27:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2018-12-02 06:27:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-02 06:27:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2018-12-02 06:27:08,344 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2018-12-02 06:27:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:08,344 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2018-12-02 06:27:08,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2018-12-02 06:27:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 06:27:08,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:08,346 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-02 06:27:08,346 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:08,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2018-12-02 06:27:08,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:08,405 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-02 06:27:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:08,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:08,406 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 9 states. [2018-12-02 06:27:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:09,430 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2018-12-02 06:27:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:27:09,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-02 06:27:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:09,433 INFO L225 Difference]: With dead ends: 1188 [2018-12-02 06:27:09,433 INFO L226 Difference]: Without dead ends: 1119 [2018-12-02 06:27:09,434 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-02 06:27:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-02 06:27:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 887. [2018-12-02 06:27:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-02 06:27:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1205 transitions. [2018-12-02 06:27:09,477 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1205 transitions. Word has length 50 [2018-12-02 06:27:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:09,477 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1205 transitions. [2018-12-02 06:27:09,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1205 transitions. [2018-12-02 06:27:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 06:27:09,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:09,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:09,479 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:09,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2018-12-02 06:27:09,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:09,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:09,503 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-02 06:27:09,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:09,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:09,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:09,504 INFO L87 Difference]: Start difference. First operand 887 states and 1205 transitions. Second operand 3 states. [2018-12-02 06:27:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:09,570 INFO L93 Difference]: Finished difference Result 912 states and 1233 transitions. [2018-12-02 06:27:09,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:09,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 06:27:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:09,574 INFO L225 Difference]: With dead ends: 912 [2018-12-02 06:27:09,574 INFO L226 Difference]: Without dead ends: 907 [2018-12-02 06:27:09,574 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-02 06:27:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-02 06:27:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 903. [2018-12-02 06:27:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-12-02 06:27:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2018-12-02 06:27:09,606 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 52 [2018-12-02 06:27:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:09,606 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2018-12-02 06:27:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2018-12-02 06:27:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:27:09,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:09,608 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-02 06:27:09,608 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:09,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2018-12-02 06:27:09,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:09,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:09,626 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-02 06:27:09,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:09,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:09,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:09,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:09,627 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand 3 states. [2018-12-02 06:27:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:09,707 INFO L93 Difference]: Finished difference Result 1116 states and 1511 transitions. [2018-12-02 06:27:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:09,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-02 06:27:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:09,711 INFO L225 Difference]: With dead ends: 1116 [2018-12-02 06:27:09,711 INFO L226 Difference]: Without dead ends: 875 [2018-12-02 06:27:09,712 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-02 06:27:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-02 06:27:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2018-12-02 06:27:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-02 06:27:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1187 transitions. [2018-12-02 06:27:09,761 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1187 transitions. Word has length 54 [2018-12-02 06:27:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:09,762 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1187 transitions. [2018-12-02 06:27:09,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1187 transitions. [2018-12-02 06:27:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:27:09,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:09,764 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-02 06:27:09,764 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:09,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2018-12-02 06:27:09,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:09,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:09,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:09,811 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-02 06:27:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:09,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:09,812 INFO L87 Difference]: Start difference. First operand 875 states and 1187 transitions. Second operand 5 states. [2018-12-02 06:27:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:10,090 INFO L93 Difference]: Finished difference Result 885 states and 1195 transitions. [2018-12-02 06:27:10,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:10,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 06:27:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:10,092 INFO L225 Difference]: With dead ends: 885 [2018-12-02 06:27:10,093 INFO L226 Difference]: Without dead ends: 879 [2018-12-02 06:27:10,093 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-02 06:27:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-02 06:27:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 875. [2018-12-02 06:27:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-02 06:27:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1186 transitions. [2018-12-02 06:27:10,123 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1186 transitions. Word has length 53 [2018-12-02 06:27:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:10,124 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1186 transitions. [2018-12-02 06:27:10,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1186 transitions. [2018-12-02 06:27:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 06:27:10,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:10,125 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-02 06:27:10,126 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:10,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2018-12-02 06:27:10,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:10,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:10,149 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-02 06:27:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:10,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:10,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:10,150 INFO L87 Difference]: Start difference. First operand 875 states and 1186 transitions. Second operand 5 states. [2018-12-02 06:27:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:10,438 INFO L93 Difference]: Finished difference Result 887 states and 1197 transitions. [2018-12-02 06:27:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:10,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-02 06:27:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:10,440 INFO L225 Difference]: With dead ends: 887 [2018-12-02 06:27:10,440 INFO L226 Difference]: Without dead ends: 851 [2018-12-02 06:27:10,441 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-02 06:27:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-02 06:27:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 847. [2018-12-02 06:27:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-02 06:27:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1154 transitions. [2018-12-02 06:27:10,470 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1154 transitions. Word has length 52 [2018-12-02 06:27:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:10,470 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1154 transitions. [2018-12-02 06:27:10,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1154 transitions. [2018-12-02 06:27:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:27:10,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:10,471 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-02 06:27:10,471 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:10,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2018-12-02 06:27:10,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:10,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:10,494 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-02 06:27:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:10,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:10,495 INFO L87 Difference]: Start difference. First operand 847 states and 1154 transitions. Second operand 5 states. [2018-12-02 06:27:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:10,814 INFO L93 Difference]: Finished difference Result 855 states and 1160 transitions. [2018-12-02 06:27:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:10,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 06:27:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:10,818 INFO L225 Difference]: With dead ends: 855 [2018-12-02 06:27:10,818 INFO L226 Difference]: Without dead ends: 849 [2018-12-02 06:27:10,818 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-02 06:27:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-02 06:27:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2018-12-02 06:27:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-02 06:27:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2018-12-02 06:27:10,880 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2018-12-02 06:27:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:10,880 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2018-12-02 06:27:10,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2018-12-02 06:27:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 06:27:10,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:10,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] [2018-12-02 06:27:10,882 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:10,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2018-12-02 06:27:10,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:10,957 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-02 06:27:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:10,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:10,958 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 4 states. [2018-12-02 06:27:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:11,080 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2018-12-02 06:27:11,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:27:11,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 06:27:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:11,083 INFO L225 Difference]: With dead ends: 886 [2018-12-02 06:27:11,083 INFO L226 Difference]: Without dead ends: 854 [2018-12-02 06:27:11,084 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-02 06:27:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-12-02 06:27:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 849. [2018-12-02 06:27:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-02 06:27:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1155 transitions. [2018-12-02 06:27:11,142 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1155 transitions. Word has length 55 [2018-12-02 06:27:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:11,142 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1155 transitions. [2018-12-02 06:27:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1155 transitions. [2018-12-02 06:27:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 06:27:11,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:11,144 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-02 06:27:11,145 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:11,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1261798154, now seen corresponding path program 1 times [2018-12-02 06:27:11,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:11,202 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-02 06:27:11,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:11,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:11,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:11,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:11,203 INFO L87 Difference]: Start difference. First operand 849 states and 1155 transitions. Second operand 9 states. [2018-12-02 06:27:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:11,347 INFO L93 Difference]: Finished difference Result 876 states and 1185 transitions. [2018-12-02 06:27:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:11,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-02 06:27:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:11,350 INFO L225 Difference]: With dead ends: 876 [2018-12-02 06:27:11,350 INFO L226 Difference]: Without dead ends: 838 [2018-12-02 06:27:11,351 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-02 06:27:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-12-02 06:27:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-12-02 06:27:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-12-02 06:27:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2018-12-02 06:27:11,404 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2018-12-02 06:27:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:11,404 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2018-12-02 06:27:11,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2018-12-02 06:27:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 06:27:11,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:11,406 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-02 06:27:11,406 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:11,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash -405944758, now seen corresponding path program 1 times [2018-12-02 06:27:11,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:11,491 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-02 06:27:11,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:27:11,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:27:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:27:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:27:11,492 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2018-12-02 06:27:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:11,667 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2018-12-02 06:27:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:27:11,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-02 06:27:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:11,669 INFO L225 Difference]: With dead ends: 854 [2018-12-02 06:27:11,669 INFO L226 Difference]: Without dead ends: 836 [2018-12-02 06:27:11,670 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-02 06:27:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-02 06:27:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2018-12-02 06:27:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-12-02 06:27:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2018-12-02 06:27:11,719 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2018-12-02 06:27:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:11,720 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2018-12-02 06:27:11,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:27:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2018-12-02 06:27:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 06:27:11,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:11,721 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-02 06:27:11,721 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:11,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:11,722 INFO L82 PathProgramCache]: Analyzing trace with hash 64942578, now seen corresponding path program 1 times [2018-12-02 06:27:11,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:11,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:11,808 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-02 06:27:11,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:11,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:27:11,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:27:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:27:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:27:11,809 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2018-12-02 06:27:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:11,956 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2018-12-02 06:27:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:27:11,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-02 06:27:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:11,958 INFO L225 Difference]: With dead ends: 849 [2018-12-02 06:27:11,958 INFO L226 Difference]: Without dead ends: 831 [2018-12-02 06:27:11,959 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-02 06:27:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-02 06:27:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-12-02 06:27:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-02 06:27:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2018-12-02 06:27:11,987 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2018-12-02 06:27:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:11,987 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2018-12-02 06:27:11,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:27:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2018-12-02 06:27:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 06:27:11,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:11,988 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:11,988 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:11,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:11,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1868951225, now seen corresponding path program 1 times [2018-12-02 06:27:11,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:11,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:12,011 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-02 06:27:12,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:12,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:12,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:12,011 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 3 states. [2018-12-02 06:27:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:12,046 INFO L93 Difference]: Finished difference Result 1084 states and 1452 transitions. [2018-12-02 06:27:12,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:12,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-02 06:27:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:12,048 INFO L225 Difference]: With dead ends: 1084 [2018-12-02 06:27:12,048 INFO L226 Difference]: Without dead ends: 921 [2018-12-02 06:27:12,049 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-02 06:27:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-12-02 06:27:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 890. [2018-12-02 06:27:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-02 06:27:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1194 transitions. [2018-12-02 06:27:12,080 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1194 transitions. Word has length 74 [2018-12-02 06:27:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:12,080 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1194 transitions. [2018-12-02 06:27:12,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1194 transitions. [2018-12-02 06:27:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 06:27:12,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:12,082 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-02 06:27:12,082 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:12,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2018-12-02 06:27:12,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:12,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:12,182 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-02 06:27:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:12,183 INFO L87 Difference]: Start difference. First operand 890 states and 1194 transitions. Second operand 11 states. [2018-12-02 06:27:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:12,346 INFO L93 Difference]: Finished difference Result 907 states and 1212 transitions. [2018-12-02 06:27:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:12,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-02 06:27:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:12,349 INFO L225 Difference]: With dead ends: 907 [2018-12-02 06:27:12,349 INFO L226 Difference]: Without dead ends: 887 [2018-12-02 06:27:12,350 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-02 06:27:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-02 06:27:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2018-12-02 06:27:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-02 06:27:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1189 transitions. [2018-12-02 06:27:12,397 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1189 transitions. Word has length 58 [2018-12-02 06:27:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:12,397 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1189 transitions. [2018-12-02 06:27:12,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1189 transitions. [2018-12-02 06:27:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 06:27:12,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:12,399 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-02 06:27:12,399 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:12,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -894292447, now seen corresponding path program 1 times [2018-12-02 06:27:12,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:12,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:12,480 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-02 06:27:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:12,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:12,481 INFO L87 Difference]: Start difference. First operand 887 states and 1189 transitions. Second operand 12 states. [2018-12-02 06:27:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:12,642 INFO L93 Difference]: Finished difference Result 913 states and 1217 transitions. [2018-12-02 06:27:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:12,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-02 06:27:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:12,645 INFO L225 Difference]: With dead ends: 913 [2018-12-02 06:27:12,645 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 06:27:12,645 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-02 06:27:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 06:27:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2018-12-02 06:27:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-02 06:27:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2018-12-02 06:27:12,679 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 59 [2018-12-02 06:27:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:12,680 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2018-12-02 06:27:12,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2018-12-02 06:27:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 06:27:12,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:12,681 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-02 06:27:12,681 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:12,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2018-12-02 06:27:12,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:12,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:12,735 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-02 06:27:12,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:12,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:12,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:12,736 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand 3 states. [2018-12-02 06:27:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:12,765 INFO L93 Difference]: Finished difference Result 920 states and 1212 transitions. [2018-12-02 06:27:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:12,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-02 06:27:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:12,767 INFO L225 Difference]: With dead ends: 920 [2018-12-02 06:27:12,767 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 06:27:12,768 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-02 06:27:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 06:27:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2018-12-02 06:27:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-12-02 06:27:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1177 transitions. [2018-12-02 06:27:12,798 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1177 transitions. Word has length 59 [2018-12-02 06:27:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:12,798 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1177 transitions. [2018-12-02 06:27:12,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1177 transitions. [2018-12-02 06:27:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 06:27:12,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:12,799 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-02 06:27:12,799 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:12,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1685241316, now seen corresponding path program 1 times [2018-12-02 06:27:12,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:12,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:12,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:12,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:12,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:12,854 INFO L87 Difference]: Start difference. First operand 886 states and 1177 transitions. Second operand 9 states. [2018-12-02 06:27:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:12,972 INFO L93 Difference]: Finished difference Result 908 states and 1200 transitions. [2018-12-02 06:27:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:12,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-12-02 06:27:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:12,974 INFO L225 Difference]: With dead ends: 908 [2018-12-02 06:27:12,974 INFO L226 Difference]: Without dead ends: 874 [2018-12-02 06:27:12,975 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-02 06:27:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-02 06:27:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-12-02 06:27:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-02 06:27:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1157 transitions. [2018-12-02 06:27:13,024 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1157 transitions. Word has length 59 [2018-12-02 06:27:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,025 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1157 transitions. [2018-12-02 06:27:13,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1157 transitions. [2018-12-02 06:27:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 06:27:13,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,026 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-02 06:27:13,026 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2018-12-02 06:27:13,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:13,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:13,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:13,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:13,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:27:13,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:27:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:27:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:27:13,050 INFO L87 Difference]: Start difference. First operand 874 states and 1157 transitions. Second operand 4 states. [2018-12-02 06:27:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:13,165 INFO L93 Difference]: Finished difference Result 1034 states and 1385 transitions. [2018-12-02 06:27:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:27:13,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 06:27:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:13,168 INFO L225 Difference]: With dead ends: 1034 [2018-12-02 06:27:13,168 INFO L226 Difference]: Without dead ends: 923 [2018-12-02 06:27:13,168 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-02 06:27:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-02 06:27:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 881. [2018-12-02 06:27:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-02 06:27:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1173 transitions. [2018-12-02 06:27:13,200 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1173 transitions. Word has length 60 [2018-12-02 06:27:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,200 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1173 transitions. [2018-12-02 06:27:13,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:27:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1173 transitions. [2018-12-02 06:27:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 06:27:13,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:13,201 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2018-12-02 06:27:13,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:13,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:13,260 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-02 06:27:13,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:13,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:13,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:13,261 INFO L87 Difference]: Start difference. First operand 881 states and 1173 transitions. Second operand 11 states. [2018-12-02 06:27:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:13,356 INFO L93 Difference]: Finished difference Result 950 states and 1266 transitions. [2018-12-02 06:27:13,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:13,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-02 06:27:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:13,359 INFO L225 Difference]: With dead ends: 950 [2018-12-02 06:27:13,359 INFO L226 Difference]: Without dead ends: 895 [2018-12-02 06:27:13,360 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-02 06:27:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-12-02 06:27:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 885. [2018-12-02 06:27:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-02 06:27:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1191 transitions. [2018-12-02 06:27:13,401 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1191 transitions. Word has length 60 [2018-12-02 06:27:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,401 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1191 transitions. [2018-12-02 06:27:13,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1191 transitions. [2018-12-02 06:27:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 06:27:13,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,402 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-02 06:27:13,402 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2018-12-02 06:27:13,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:13,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:13,465 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-02 06:27:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:13,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:13,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:13,466 INFO L87 Difference]: Start difference. First operand 885 states and 1191 transitions. Second operand 9 states. [2018-12-02 06:27:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:13,586 INFO L93 Difference]: Finished difference Result 916 states and 1228 transitions. [2018-12-02 06:27:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:27:13,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-02 06:27:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:13,588 INFO L225 Difference]: With dead ends: 916 [2018-12-02 06:27:13,588 INFO L226 Difference]: Without dead ends: 877 [2018-12-02 06:27:13,589 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-02 06:27:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-12-02 06:27:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2018-12-02 06:27:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-12-02 06:27:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1175 transitions. [2018-12-02 06:27:13,622 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1175 transitions. Word has length 60 [2018-12-02 06:27:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,622 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1175 transitions. [2018-12-02 06:27:13,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1175 transitions. [2018-12-02 06:27:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:27:13,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,623 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-02 06:27:13,623 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash -200520490, now seen corresponding path program 1 times [2018-12-02 06:27:13,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:13,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:13,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:13,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:13,750 INFO L87 Difference]: Start difference. First operand 877 states and 1175 transitions. Second operand 13 states. [2018-12-02 06:27:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:13,944 INFO L93 Difference]: Finished difference Result 894 states and 1193 transitions. [2018-12-02 06:27:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:13,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-02 06:27:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:13,947 INFO L225 Difference]: With dead ends: 894 [2018-12-02 06:27:13,947 INFO L226 Difference]: Without dead ends: 872 [2018-12-02 06:27:13,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:27:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-12-02 06:27:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2018-12-02 06:27:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-02 06:27:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1168 transitions. [2018-12-02 06:27:13,986 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1168 transitions. Word has length 62 [2018-12-02 06:27:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:13,986 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1168 transitions. [2018-12-02 06:27:13,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1168 transitions. [2018-12-02 06:27:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:27:13,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:13,988 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-02 06:27:13,988 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:13,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -478986825, now seen corresponding path program 1 times [2018-12-02 06:27:13,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,017 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-02 06:27:14,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:14,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:14,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:14,018 INFO L87 Difference]: Start difference. First operand 872 states and 1168 transitions. Second operand 3 states. [2018-12-02 06:27:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:14,052 INFO L93 Difference]: Finished difference Result 1158 states and 1551 transitions. [2018-12-02 06:27:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:14,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-02 06:27:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:14,054 INFO L225 Difference]: With dead ends: 1158 [2018-12-02 06:27:14,054 INFO L226 Difference]: Without dead ends: 797 [2018-12-02 06:27:14,056 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-02 06:27:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-02 06:27:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 766. [2018-12-02 06:27:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-12-02 06:27:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 995 transitions. [2018-12-02 06:27:14,092 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 995 transitions. Word has length 62 [2018-12-02 06:27:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:14,092 INFO L480 AbstractCegarLoop]: Abstraction has 766 states and 995 transitions. [2018-12-02 06:27:14,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 995 transitions. [2018-12-02 06:27:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 06:27:14,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:14,094 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-02 06:27:14,094 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:14,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash 551685876, now seen corresponding path program 1 times [2018-12-02 06:27:14,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:14,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:14,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:14,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,177 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-02 06:27:14,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:14,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:14,179 INFO L87 Difference]: Start difference. First operand 766 states and 995 transitions. Second operand 12 states. [2018-12-02 06:27:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:14,340 INFO L93 Difference]: Finished difference Result 790 states and 1020 transitions. [2018-12-02 06:27:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:14,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-02 06:27:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:14,341 INFO L225 Difference]: With dead ends: 790 [2018-12-02 06:27:14,341 INFO L226 Difference]: Without dead ends: 766 [2018-12-02 06:27:14,342 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-02 06:27:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-12-02 06:27:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 764. [2018-12-02 06:27:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-02 06:27:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 991 transitions. [2018-12-02 06:27:14,386 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 991 transitions. Word has length 66 [2018-12-02 06:27:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:14,386 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 991 transitions. [2018-12-02 06:27:14,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 991 transitions. [2018-12-02 06:27:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:27:14,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:14,387 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-02 06:27:14,387 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:14,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -930632011, now seen corresponding path program 1 times [2018-12-02 06:27:14,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,467 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-02 06:27:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:14,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:14,468 INFO L87 Difference]: Start difference. First operand 764 states and 991 transitions. Second operand 12 states. [2018-12-02 06:27:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:14,613 INFO L93 Difference]: Finished difference Result 786 states and 1014 transitions. [2018-12-02 06:27:14,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:14,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-02 06:27:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:14,615 INFO L225 Difference]: With dead ends: 786 [2018-12-02 06:27:14,615 INFO L226 Difference]: Without dead ends: 762 [2018-12-02 06:27:14,615 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-02 06:27:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-12-02 06:27:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2018-12-02 06:27:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-12-02 06:27:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 987 transitions. [2018-12-02 06:27:14,642 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 987 transitions. Word has length 63 [2018-12-02 06:27:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:14,642 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 987 transitions. [2018-12-02 06:27:14,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2018-12-02 06:27:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:27:14,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:14,643 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-02 06:27:14,643 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:14,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1661318765, now seen corresponding path program 1 times [2018-12-02 06:27:14,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:14,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,689 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-02 06:27:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:14,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:14,690 INFO L87 Difference]: Start difference. First operand 762 states and 987 transitions. Second operand 5 states. [2018-12-02 06:27:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:14,786 INFO L93 Difference]: Finished difference Result 796 states and 1026 transitions. [2018-12-02 06:27:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:14,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 06:27:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:14,788 INFO L225 Difference]: With dead ends: 796 [2018-12-02 06:27:14,788 INFO L226 Difference]: Without dead ends: 769 [2018-12-02 06:27:14,789 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-02 06:27:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-12-02 06:27:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 767. [2018-12-02 06:27:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-12-02 06:27:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 995 transitions. [2018-12-02 06:27:14,834 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 995 transitions. Word has length 62 [2018-12-02 06:27:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:14,835 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 995 transitions. [2018-12-02 06:27:14,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 995 transitions. [2018-12-02 06:27:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:27:14,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:14,836 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-02 06:27:14,836 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:14,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:14,837 INFO L82 PathProgramCache]: Analyzing trace with hash 813191735, now seen corresponding path program 1 times [2018-12-02 06:27:14,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:14,900 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-02 06:27:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:14,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:14,901 INFO L87 Difference]: Start difference. First operand 767 states and 995 transitions. Second operand 12 states. [2018-12-02 06:27:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,035 INFO L93 Difference]: Finished difference Result 791 states and 1020 transitions. [2018-12-02 06:27:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:15,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-02 06:27:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,036 INFO L225 Difference]: With dead ends: 791 [2018-12-02 06:27:15,037 INFO L226 Difference]: Without dead ends: 767 [2018-12-02 06:27:15,037 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-02 06:27:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-12-02 06:27:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2018-12-02 06:27:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-02 06:27:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 991 transitions. [2018-12-02 06:27:15,064 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 991 transitions. Word has length 67 [2018-12-02 06:27:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:15,064 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 991 transitions. [2018-12-02 06:27:15,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 991 transitions. [2018-12-02 06:27:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:27:15,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:15,065 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-02 06:27:15,065 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:15,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1932048657, now seen corresponding path program 1 times [2018-12-02 06:27:15,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:15,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:15,134 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-02 06:27:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:15,135 INFO L87 Difference]: Start difference. First operand 765 states and 991 transitions. Second operand 12 states. [2018-12-02 06:27:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,278 INFO L93 Difference]: Finished difference Result 787 states and 1014 transitions. [2018-12-02 06:27:15,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:15,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-02 06:27:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,280 INFO L225 Difference]: With dead ends: 787 [2018-12-02 06:27:15,280 INFO L226 Difference]: Without dead ends: 763 [2018-12-02 06:27:15,281 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-02 06:27:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-12-02 06:27:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 758. [2018-12-02 06:27:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-12-02 06:27:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 979 transitions. [2018-12-02 06:27:15,323 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 979 transitions. Word has length 62 [2018-12-02 06:27:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:15,324 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 979 transitions. [2018-12-02 06:27:15,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 979 transitions. [2018-12-02 06:27:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:27:15,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:15,325 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-02 06:27:15,325 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:15,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -850493366, now seen corresponding path program 1 times [2018-12-02 06:27:15,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:15,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:15,408 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-02 06:27:15,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:15,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:15,409 INFO L87 Difference]: Start difference. First operand 758 states and 979 transitions. Second operand 13 states. [2018-12-02 06:27:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,570 INFO L93 Difference]: Finished difference Result 775 states and 997 transitions. [2018-12-02 06:27:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:15,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-02 06:27:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,572 INFO L225 Difference]: With dead ends: 775 [2018-12-02 06:27:15,572 INFO L226 Difference]: Without dead ends: 753 [2018-12-02 06:27:15,572 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-02 06:27:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-12-02 06:27:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-12-02 06:27:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 06:27:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 972 transitions. [2018-12-02 06:27:15,598 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 972 transitions. Word has length 63 [2018-12-02 06:27:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:15,598 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 972 transitions. [2018-12-02 06:27:15,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 972 transitions. [2018-12-02 06:27:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 06:27:15,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:15,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:15,599 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:15,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1755012540, now seen corresponding path program 1 times [2018-12-02 06:27:15,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:15,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:15,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:15,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:15,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:15,619 INFO L87 Difference]: Start difference. First operand 753 states and 972 transitions. Second operand 3 states. [2018-12-02 06:27:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,645 INFO L93 Difference]: Finished difference Result 883 states and 1145 transitions. [2018-12-02 06:27:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:15,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 06:27:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,647 INFO L225 Difference]: With dead ends: 883 [2018-12-02 06:27:15,647 INFO L226 Difference]: Without dead ends: 753 [2018-12-02 06:27:15,647 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-02 06:27:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-12-02 06:27:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-12-02 06:27:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 06:27:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 970 transitions. [2018-12-02 06:27:15,683 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 970 transitions. Word has length 66 [2018-12-02 06:27:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:15,684 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 970 transitions. [2018-12-02 06:27:15,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 970 transitions. [2018-12-02 06:27:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 06:27:15,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:15,685 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-02 06:27:15,685 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:15,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -679697142, now seen corresponding path program 1 times [2018-12-02 06:27:15,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:15,716 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-02 06:27:15,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:15,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:15,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:15,717 INFO L87 Difference]: Start difference. First operand 753 states and 970 transitions. Second operand 5 states. [2018-12-02 06:27:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,781 INFO L93 Difference]: Finished difference Result 807 states and 1029 transitions. [2018-12-02 06:27:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:15,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 06:27:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,782 INFO L225 Difference]: With dead ends: 807 [2018-12-02 06:27:15,783 INFO L226 Difference]: Without dead ends: 755 [2018-12-02 06:27:15,783 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-02 06:27:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-12-02 06:27:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-12-02 06:27:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 06:27:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 969 transitions. [2018-12-02 06:27:15,811 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 969 transitions. Word has length 65 [2018-12-02 06:27:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:15,811 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 969 transitions. [2018-12-02 06:27:15,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 969 transitions. [2018-12-02 06:27:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 06:27:15,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:15,812 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-02 06:27:15,812 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:15,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash 21902732, now seen corresponding path program 1 times [2018-12-02 06:27:15,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:15,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:15,845 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-02 06:27:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:15,847 INFO L87 Difference]: Start difference. First operand 753 states and 969 transitions. Second operand 5 states. [2018-12-02 06:27:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:15,996 INFO L93 Difference]: Finished difference Result 817 states and 1044 transitions. [2018-12-02 06:27:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:15,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 06:27:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:15,998 INFO L225 Difference]: With dead ends: 817 [2018-12-02 06:27:15,998 INFO L226 Difference]: Without dead ends: 784 [2018-12-02 06:27:15,998 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-02 06:27:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-12-02 06:27:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 759. [2018-12-02 06:27:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-02 06:27:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 976 transitions. [2018-12-02 06:27:16,045 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 976 transitions. Word has length 65 [2018-12-02 06:27:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,046 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 976 transitions. [2018-12-02 06:27:16,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 976 transitions. [2018-12-02 06:27:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 06:27:16,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,047 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-02 06:27:16,047 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 544587914, now seen corresponding path program 1 times [2018-12-02 06:27:16,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,106 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-02 06:27:16,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:16,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:16,107 INFO L87 Difference]: Start difference. First operand 759 states and 976 transitions. Second operand 11 states. [2018-12-02 06:27:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,204 INFO L93 Difference]: Finished difference Result 781 states and 999 transitions. [2018-12-02 06:27:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:16,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-12-02 06:27:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,205 INFO L225 Difference]: With dead ends: 781 [2018-12-02 06:27:16,205 INFO L226 Difference]: Without dead ends: 755 [2018-12-02 06:27:16,206 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-02 06:27:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-12-02 06:27:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 749. [2018-12-02 06:27:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-12-02 06:27:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 962 transitions. [2018-12-02 06:27:16,232 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 962 transitions. Word has length 66 [2018-12-02 06:27:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,232 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 962 transitions. [2018-12-02 06:27:16,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 962 transitions. [2018-12-02 06:27:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:27:16,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,233 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-02 06:27:16,233 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash 31965889, now seen corresponding path program 1 times [2018-12-02 06:27:16,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,253 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-02 06:27:16,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:16,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:16,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:16,253 INFO L87 Difference]: Start difference. First operand 749 states and 962 transitions. Second operand 5 states. [2018-12-02 06:27:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,303 INFO L93 Difference]: Finished difference Result 790 states and 1006 transitions. [2018-12-02 06:27:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:16,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:27:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,305 INFO L225 Difference]: With dead ends: 790 [2018-12-02 06:27:16,305 INFO L226 Difference]: Without dead ends: 756 [2018-12-02 06:27:16,306 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-02 06:27:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-12-02 06:27:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 749. [2018-12-02 06:27:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-12-02 06:27:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 961 transitions. [2018-12-02 06:27:16,334 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 961 transitions. Word has length 67 [2018-12-02 06:27:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,335 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 961 transitions. [2018-12-02 06:27:16,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 961 transitions. [2018-12-02 06:27:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:27:16,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,335 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-02 06:27:16,336 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1319946579, now seen corresponding path program 1 times [2018-12-02 06:27:16,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,387 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-02 06:27:16,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:16,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:16,387 INFO L87 Difference]: Start difference. First operand 749 states and 961 transitions. Second operand 6 states. [2018-12-02 06:27:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,452 INFO L93 Difference]: Finished difference Result 788 states and 1002 transitions. [2018-12-02 06:27:16,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:16,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 06:27:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,453 INFO L225 Difference]: With dead ends: 788 [2018-12-02 06:27:16,453 INFO L226 Difference]: Without dead ends: 756 [2018-12-02 06:27:16,454 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-02 06:27:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-12-02 06:27:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 751. [2018-12-02 06:27:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-02 06:27:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 963 transitions. [2018-12-02 06:27:16,480 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 963 transitions. Word has length 68 [2018-12-02 06:27:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,480 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 963 transitions. [2018-12-02 06:27:16,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 963 transitions. [2018-12-02 06:27:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:27:16,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,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] [2018-12-02 06:27:16,481 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 810473489, now seen corresponding path program 1 times [2018-12-02 06:27:16,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:16,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:16,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:16,536 INFO L87 Difference]: Start difference. First operand 751 states and 963 transitions. Second operand 11 states. [2018-12-02 06:27:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,623 INFO L93 Difference]: Finished difference Result 776 states and 990 transitions. [2018-12-02 06:27:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:16,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-02 06:27:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,624 INFO L225 Difference]: With dead ends: 776 [2018-12-02 06:27:16,624 INFO L226 Difference]: Without dead ends: 743 [2018-12-02 06:27:16,625 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-02 06:27:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-02 06:27:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-12-02 06:27:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-12-02 06:27:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 953 transitions. [2018-12-02 06:27:16,650 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 953 transitions. Word has length 68 [2018-12-02 06:27:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,650 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 953 transitions. [2018-12-02 06:27:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 953 transitions. [2018-12-02 06:27:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:27:16,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,651 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-02 06:27:16,651 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1140935392, now seen corresponding path program 1 times [2018-12-02 06:27:16,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,708 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-02 06:27:16,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:16,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:16,708 INFO L87 Difference]: Start difference. First operand 743 states and 953 transitions. Second operand 6 states. [2018-12-02 06:27:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,761 INFO L93 Difference]: Finished difference Result 790 states and 1001 transitions. [2018-12-02 06:27:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:16,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 06:27:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,763 INFO L225 Difference]: With dead ends: 790 [2018-12-02 06:27:16,763 INFO L226 Difference]: Without dead ends: 738 [2018-12-02 06:27:16,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-02 06:27:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-02 06:27:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-12-02 06:27:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-02 06:27:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 940 transitions. [2018-12-02 06:27:16,789 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 940 transitions. Word has length 68 [2018-12-02 06:27:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,789 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 940 transitions. [2018-12-02 06:27:16,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 940 transitions. [2018-12-02 06:27:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:27:16,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,791 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-02 06:27:16,791 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 631462302, now seen corresponding path program 1 times [2018-12-02 06:27:16,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,849 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-02 06:27:16,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:16,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:16,850 INFO L87 Difference]: Start difference. First operand 736 states and 940 transitions. Second operand 11 states. [2018-12-02 06:27:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:16,929 INFO L93 Difference]: Finished difference Result 758 states and 963 transitions. [2018-12-02 06:27:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:16,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-12-02 06:27:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:16,930 INFO L225 Difference]: With dead ends: 758 [2018-12-02 06:27:16,930 INFO L226 Difference]: Without dead ends: 726 [2018-12-02 06:27:16,931 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-02 06:27:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-12-02 06:27:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-12-02 06:27:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 06:27:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 926 transitions. [2018-12-02 06:27:16,961 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 926 transitions. Word has length 68 [2018-12-02 06:27:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:16,961 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 926 transitions. [2018-12-02 06:27:16,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 926 transitions. [2018-12-02 06:27:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 06:27:16,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:16,962 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-02 06:27:16,962 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash -715584647, now seen corresponding path program 1 times [2018-12-02 06:27:16,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:16,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:16,987 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-02 06:27:16,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:16,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:16,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:16,988 INFO L87 Difference]: Start difference. First operand 726 states and 926 transitions. Second operand 5 states. [2018-12-02 06:27:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,219 INFO L93 Difference]: Finished difference Result 804 states and 1027 transitions. [2018-12-02 06:27:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:17,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 06:27:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,220 INFO L225 Difference]: With dead ends: 804 [2018-12-02 06:27:17,220 INFO L226 Difference]: Without dead ends: 798 [2018-12-02 06:27:17,221 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-02 06:27:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-12-02 06:27:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 726. [2018-12-02 06:27:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 06:27:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 925 transitions. [2018-12-02 06:27:17,256 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 925 transitions. Word has length 68 [2018-12-02 06:27:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,257 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 925 transitions. [2018-12-02 06:27:17,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 925 transitions. [2018-12-02 06:27:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,257 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-02 06:27:17,258 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1565715428, now seen corresponding path program 1 times [2018-12-02 06:27:17,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,279 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-02 06:27:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:17,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:17,280 INFO L87 Difference]: Start difference. First operand 726 states and 925 transitions. Second operand 5 states. [2018-12-02 06:27:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,320 INFO L93 Difference]: Finished difference Result 767 states and 969 transitions. [2018-12-02 06:27:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:17,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 06:27:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,321 INFO L225 Difference]: With dead ends: 767 [2018-12-02 06:27:17,321 INFO L226 Difference]: Without dead ends: 733 [2018-12-02 06:27:17,321 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-02 06:27:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-02 06:27:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 726. [2018-12-02 06:27:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 06:27:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 924 transitions. [2018-12-02 06:27:17,347 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 924 transitions. Word has length 69 [2018-12-02 06:27:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 924 transitions. [2018-12-02 06:27:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 924 transitions. [2018-12-02 06:27:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,348 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-02 06:27:17,348 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1543083174, now seen corresponding path program 1 times [2018-12-02 06:27:17,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,403 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-02 06:27:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:17,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:17,404 INFO L87 Difference]: Start difference. First operand 726 states and 924 transitions. Second operand 6 states. [2018-12-02 06:27:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,466 INFO L93 Difference]: Finished difference Result 765 states and 965 transitions. [2018-12-02 06:27:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:17,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 06:27:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,468 INFO L225 Difference]: With dead ends: 765 [2018-12-02 06:27:17,468 INFO L226 Difference]: Without dead ends: 733 [2018-12-02 06:27:17,468 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-02 06:27:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-02 06:27:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 728. [2018-12-02 06:27:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-02 06:27:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 926 transitions. [2018-12-02 06:27:17,503 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 926 transitions. Word has length 69 [2018-12-02 06:27:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,503 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 926 transitions. [2018-12-02 06:27:17,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 926 transitions. [2018-12-02 06:27:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,504 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-02 06:27:17,504 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2052556264, now seen corresponding path program 1 times [2018-12-02 06:27:17,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,564 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-02 06:27:17,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:17,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:17,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:17,565 INFO L87 Difference]: Start difference. First operand 728 states and 926 transitions. Second operand 11 states. [2018-12-02 06:27:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,650 INFO L93 Difference]: Finished difference Result 753 states and 953 transitions. [2018-12-02 06:27:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:17,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 06:27:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,651 INFO L225 Difference]: With dead ends: 753 [2018-12-02 06:27:17,651 INFO L226 Difference]: Without dead ends: 721 [2018-12-02 06:27:17,652 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-02 06:27:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-12-02 06:27:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-12-02 06:27:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-12-02 06:27:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 917 transitions. [2018-12-02 06:27:17,677 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 917 transitions. Word has length 69 [2018-12-02 06:27:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,677 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 917 transitions. [2018-12-02 06:27:17,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 917 transitions. [2018-12-02 06:27:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,678 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-02 06:27:17,678 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1351290009, now seen corresponding path program 1 times [2018-12-02 06:27:17,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,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-02 06:27:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:17,714 INFO L87 Difference]: Start difference. First operand 721 states and 917 transitions. Second operand 6 states. [2018-12-02 06:27:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,772 INFO L93 Difference]: Finished difference Result 760 states and 958 transitions. [2018-12-02 06:27:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:17,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 06:27:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,773 INFO L225 Difference]: With dead ends: 760 [2018-12-02 06:27:17,773 INFO L226 Difference]: Without dead ends: 728 [2018-12-02 06:27:17,773 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-02 06:27:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-02 06:27:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 723. [2018-12-02 06:27:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-12-02 06:27:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 919 transitions. [2018-12-02 06:27:17,799 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 919 transitions. Word has length 69 [2018-12-02 06:27:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,799 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 919 transitions. [2018-12-02 06:27:17,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 919 transitions. [2018-12-02 06:27:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 06:27:17,800 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1860763099, now seen corresponding path program 1 times [2018-12-02 06:27:17,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:17,855 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-02 06:27:17,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:17,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:17,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:17,855 INFO L87 Difference]: Start difference. First operand 723 states and 919 transitions. Second operand 11 states. [2018-12-02 06:27:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:17,934 INFO L93 Difference]: Finished difference Result 748 states and 946 transitions. [2018-12-02 06:27:17,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:17,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 06:27:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:17,935 INFO L225 Difference]: With dead ends: 748 [2018-12-02 06:27:17,936 INFO L226 Difference]: Without dead ends: 718 [2018-12-02 06:27:17,936 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-02 06:27:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-12-02 06:27:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-12-02 06:27:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-12-02 06:27:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 912 transitions. [2018-12-02 06:27:17,962 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 912 transitions. Word has length 69 [2018-12-02 06:27:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:17,962 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 912 transitions. [2018-12-02 06:27:17,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 912 transitions. [2018-12-02 06:27:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:17,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:17,964 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-02 06:27:17,964 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:17,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1348608070, now seen corresponding path program 1 times [2018-12-02 06:27:17,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:17,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:17,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:17,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:18,042 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-02 06:27:18,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:18,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:18,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:18,043 INFO L87 Difference]: Start difference. First operand 718 states and 912 transitions. Second operand 11 states. [2018-12-02 06:27:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:18,163 INFO L93 Difference]: Finished difference Result 728 states and 921 transitions. [2018-12-02 06:27:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:18,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 06:27:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:18,164 INFO L225 Difference]: With dead ends: 728 [2018-12-02 06:27:18,164 INFO L226 Difference]: Without dead ends: 722 [2018-12-02 06:27:18,164 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-02 06:27:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-12-02 06:27:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 716. [2018-12-02 06:27:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-12-02 06:27:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 908 transitions. [2018-12-02 06:27:18,189 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 908 transitions. Word has length 69 [2018-12-02 06:27:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:18,189 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 908 transitions. [2018-12-02 06:27:18,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 908 transitions. [2018-12-02 06:27:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:18,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:18,190 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-02 06:27:18,190 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1348884900, now seen corresponding path program 1 times [2018-12-02 06:27:18,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:18,209 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-02 06:27:18,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:18,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:18,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:18,210 INFO L87 Difference]: Start difference. First operand 716 states and 908 transitions. Second operand 5 states. [2018-12-02 06:27:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:18,435 INFO L93 Difference]: Finished difference Result 790 states and 1005 transitions. [2018-12-02 06:27:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:18,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 06:27:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:18,437 INFO L225 Difference]: With dead ends: 790 [2018-12-02 06:27:18,437 INFO L226 Difference]: Without dead ends: 728 [2018-12-02 06:27:18,438 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-02 06:27:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-02 06:27:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 660. [2018-12-02 06:27:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-12-02 06:27:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 837 transitions. [2018-12-02 06:27:18,471 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 837 transitions. Word has length 69 [2018-12-02 06:27:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:18,471 INFO L480 AbstractCegarLoop]: Abstraction has 660 states and 837 transitions. [2018-12-02 06:27:18,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 837 transitions. [2018-12-02 06:27:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 06:27:18,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:18,472 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-02 06:27:18,472 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:18,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash 459038371, now seen corresponding path program 1 times [2018-12-02 06:27:18,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:18,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:18,521 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-02 06:27:18,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:18,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:18,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:18,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:18,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:18,522 INFO L87 Difference]: Start difference. First operand 660 states and 837 transitions. Second operand 7 states. [2018-12-02 06:27:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:18,599 INFO L93 Difference]: Finished difference Result 706 states and 887 transitions. [2018-12-02 06:27:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:18,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 06:27:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:18,600 INFO L225 Difference]: With dead ends: 706 [2018-12-02 06:27:18,600 INFO L226 Difference]: Without dead ends: 666 [2018-12-02 06:27:18,601 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-02 06:27:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-02 06:27:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2018-12-02 06:27:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-02 06:27:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 841 transitions. [2018-12-02 06:27:18,625 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 841 transitions. Word has length 74 [2018-12-02 06:27:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:18,625 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 841 transitions. [2018-12-02 06:27:18,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 841 transitions. [2018-12-02 06:27:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 06:27:18,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:18,626 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-02 06:27:18,626 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:18,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash -900473525, now seen corresponding path program 1 times [2018-12-02 06:27:18,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:18,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:18,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:18,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:18,713 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-02 06:27:18,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:18,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:27:18,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:27:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:27:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:27:18,713 INFO L87 Difference]: Start difference. First operand 664 states and 841 transitions. Second operand 12 states. [2018-12-02 06:27:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:18,828 INFO L93 Difference]: Finished difference Result 687 states and 865 transitions. [2018-12-02 06:27:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:18,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-02 06:27:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:18,830 INFO L225 Difference]: With dead ends: 687 [2018-12-02 06:27:18,830 INFO L226 Difference]: Without dead ends: 664 [2018-12-02 06:27:18,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:27:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-12-02 06:27:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2018-12-02 06:27:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-02 06:27:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 840 transitions. [2018-12-02 06:27:18,860 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 840 transitions. Word has length 70 [2018-12-02 06:27:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:18,860 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 840 transitions. [2018-12-02 06:27:18,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:27:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 840 transitions. [2018-12-02 06:27:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 06:27:18,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:18,861 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-02 06:27:18,861 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:18,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash -198873651, now seen corresponding path program 1 times [2018-12-02 06:27:18,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:18,945 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-02 06:27:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:18,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:18,946 INFO L87 Difference]: Start difference. First operand 664 states and 840 transitions. Second operand 14 states. [2018-12-02 06:27:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,094 INFO L93 Difference]: Finished difference Result 688 states and 866 transitions. [2018-12-02 06:27:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:19,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-02 06:27:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:19,095 INFO L225 Difference]: With dead ends: 688 [2018-12-02 06:27:19,095 INFO L226 Difference]: Without dead ends: 661 [2018-12-02 06:27:19,095 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-02 06:27:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-12-02 06:27:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-12-02 06:27:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-12-02 06:27:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 835 transitions. [2018-12-02 06:27:19,120 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 835 transitions. Word has length 70 [2018-12-02 06:27:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,120 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 835 transitions. [2018-12-02 06:27:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 835 transitions. [2018-12-02 06:27:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:27:19,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,121 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-02 06:27:19,122 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash -812657032, now seen corresponding path program 1 times [2018-12-02 06:27:19,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:19,215 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-02 06:27:19,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:19,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:19,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:19,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:19,216 INFO L87 Difference]: Start difference. First operand 661 states and 835 transitions. Second operand 13 states. [2018-12-02 06:27:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,389 INFO L93 Difference]: Finished difference Result 678 states and 853 transitions. [2018-12-02 06:27:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:19,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-02 06:27:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:19,390 INFO L225 Difference]: With dead ends: 678 [2018-12-02 06:27:19,390 INFO L226 Difference]: Without dead ends: 649 [2018-12-02 06:27:19,390 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-02 06:27:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-02 06:27:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2018-12-02 06:27:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-12-02 06:27:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 819 transitions. [2018-12-02 06:27:19,415 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 819 transitions. Word has length 69 [2018-12-02 06:27:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 819 transitions. [2018-12-02 06:27:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 819 transitions. [2018-12-02 06:27:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 06:27:19,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:19,416 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1712334254, now seen corresponding path program 1 times [2018-12-02 06:27:19,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:19,445 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-02 06:27:19,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:19,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:19,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:19,445 INFO L87 Difference]: Start difference. First operand 649 states and 819 transitions. Second operand 5 states. [2018-12-02 06:27:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,486 INFO L93 Difference]: Finished difference Result 696 states and 868 transitions. [2018-12-02 06:27:19,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:19,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 06:27:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:19,487 INFO L225 Difference]: With dead ends: 696 [2018-12-02 06:27:19,487 INFO L226 Difference]: Without dead ends: 653 [2018-12-02 06:27:19,487 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-02 06:27:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-12-02 06:27:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-12-02 06:27:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-12-02 06:27:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 818 transitions. [2018-12-02 06:27:19,511 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 818 transitions. Word has length 71 [2018-12-02 06:27:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,511 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 818 transitions. [2018-12-02 06:27:19,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 818 transitions. [2018-12-02 06:27:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 06:27:19,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:19,512 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -531649044, now seen corresponding path program 1 times [2018-12-02 06:27:19,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:19,575 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-02 06:27:19,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:19,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:19,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:19,576 INFO L87 Difference]: Start difference. First operand 649 states and 818 transitions. Second operand 14 states. [2018-12-02 06:27:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,695 INFO L93 Difference]: Finished difference Result 673 states and 844 transitions. [2018-12-02 06:27:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:19,695 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 06:27:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:19,696 INFO L225 Difference]: With dead ends: 673 [2018-12-02 06:27:19,696 INFO L226 Difference]: Without dead ends: 642 [2018-12-02 06:27:19,697 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-02 06:27:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-02 06:27:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-12-02 06:27:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-12-02 06:27:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 808 transitions. [2018-12-02 06:27:19,720 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 808 transitions. Word has length 71 [2018-12-02 06:27:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,720 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 808 transitions. [2018-12-02 06:27:19,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 808 transitions. [2018-12-02 06:27:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 06:27:19,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,721 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-02 06:27:19,721 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1160638245, now seen corresponding path program 1 times [2018-12-02 06:27:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:19,781 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-02 06:27:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:19,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:19,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:19,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:19,782 INFO L87 Difference]: Start difference. First operand 642 states and 808 transitions. Second operand 14 states. [2018-12-02 06:27:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:19,898 INFO L93 Difference]: Finished difference Result 664 states and 831 transitions. [2018-12-02 06:27:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:19,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-02 06:27:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:19,899 INFO L225 Difference]: With dead ends: 664 [2018-12-02 06:27:19,899 INFO L226 Difference]: Without dead ends: 632 [2018-12-02 06:27:19,900 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-02 06:27:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-12-02 06:27:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2018-12-02 06:27:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-12-02 06:27:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 793 transitions. [2018-12-02 06:27:19,924 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 793 transitions. Word has length 74 [2018-12-02 06:27:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:19,924 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 793 transitions. [2018-12-02 06:27:19,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 793 transitions. [2018-12-02 06:27:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 06:27:19,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:19,925 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-02 06:27:19,925 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:19,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906513, now seen corresponding path program 1 times [2018-12-02 06:27:19,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:20,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:20,024 INFO L87 Difference]: Start difference. First operand 632 states and 793 transitions. Second operand 14 states. [2018-12-02 06:27:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,136 INFO L93 Difference]: Finished difference Result 696 states and 861 transitions. [2018-12-02 06:27:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:20,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 06:27:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,137 INFO L225 Difference]: With dead ends: 696 [2018-12-02 06:27:20,137 INFO L226 Difference]: Without dead ends: 626 [2018-12-02 06:27:20,138 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-02 06:27:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-02 06:27:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-02 06:27:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-02 06:27:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 784 transitions. [2018-12-02 06:27:20,162 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 784 transitions. Word has length 71 [2018-12-02 06:27:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,162 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 784 transitions. [2018-12-02 06:27:20,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 784 transitions. [2018-12-02 06:27:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 06:27:20,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,163 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-02 06:27:20,164 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1065956881, now seen corresponding path program 1 times [2018-12-02 06:27:20,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,218 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-02 06:27:20,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:20,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:20,218 INFO L87 Difference]: Start difference. First operand 626 states and 784 transitions. Second operand 11 states. [2018-12-02 06:27:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,298 INFO L93 Difference]: Finished difference Result 653 states and 814 transitions. [2018-12-02 06:27:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:20,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-12-02 06:27:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,299 INFO L225 Difference]: With dead ends: 653 [2018-12-02 06:27:20,300 INFO L226 Difference]: Without dead ends: 608 [2018-12-02 06:27:20,300 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-02 06:27:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-02 06:27:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2018-12-02 06:27:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-12-02 06:27:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 756 transitions. [2018-12-02 06:27:20,322 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 756 transitions. Word has length 72 [2018-12-02 06:27:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,323 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 756 transitions. [2018-12-02 06:27:20,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 756 transitions. [2018-12-02 06:27:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 06:27:20,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,323 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-02 06:27:20,323 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1302449818, now seen corresponding path program 1 times [2018-12-02 06:27:20,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,356 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-02 06:27:20,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:20,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:20,356 INFO L87 Difference]: Start difference. First operand 608 states and 756 transitions. Second operand 6 states. [2018-12-02 06:27:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,401 INFO L93 Difference]: Finished difference Result 649 states and 800 transitions. [2018-12-02 06:27:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:20,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-02 06:27:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,402 INFO L225 Difference]: With dead ends: 649 [2018-12-02 06:27:20,402 INFO L226 Difference]: Without dead ends: 613 [2018-12-02 06:27:20,402 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-02 06:27:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-02 06:27:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 608. [2018-12-02 06:27:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-12-02 06:27:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 754 transitions. [2018-12-02 06:27:20,425 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 754 transitions. Word has length 71 [2018-12-02 06:27:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,425 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 754 transitions. [2018-12-02 06:27:20,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 754 transitions. [2018-12-02 06:27:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 06:27:20,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,426 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-02 06:27:20,426 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash 792976728, now seen corresponding path program 1 times [2018-12-02 06:27:20,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,477 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-02 06:27:20,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:20,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:20,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:20,477 INFO L87 Difference]: Start difference. First operand 608 states and 754 transitions. Second operand 11 states. [2018-12-02 06:27:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,550 INFO L93 Difference]: Finished difference Result 633 states and 781 transitions. [2018-12-02 06:27:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:20,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-02 06:27:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,551 INFO L225 Difference]: With dead ends: 633 [2018-12-02 06:27:20,551 INFO L226 Difference]: Without dead ends: 600 [2018-12-02 06:27:20,551 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-02 06:27:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-12-02 06:27:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-12-02 06:27:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-02 06:27:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 743 transitions. [2018-12-02 06:27:20,574 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 743 transitions. Word has length 71 [2018-12-02 06:27:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,574 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 743 transitions. [2018-12-02 06:27:20,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 743 transitions. [2018-12-02 06:27:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:20,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,574 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-02 06:27:20,575 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1953714458, now seen corresponding path program 1 times [2018-12-02 06:27:20,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,613 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-02 06:27:20,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:27:20,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:27:20,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:27:20,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:27:20,614 INFO L87 Difference]: Start difference. First operand 600 states and 743 transitions. Second operand 7 states. [2018-12-02 06:27:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,677 INFO L93 Difference]: Finished difference Result 654 states and 804 transitions. [2018-12-02 06:27:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:20,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-02 06:27:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,678 INFO L225 Difference]: With dead ends: 654 [2018-12-02 06:27:20,678 INFO L226 Difference]: Without dead ends: 598 [2018-12-02 06:27:20,679 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-02 06:27:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-02 06:27:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 594. [2018-12-02 06:27:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-02 06:27:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 733 transitions. [2018-12-02 06:27:20,702 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 733 transitions. Word has length 77 [2018-12-02 06:27:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,702 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 733 transitions. [2018-12-02 06:27:20,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:27:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 733 transitions. [2018-12-02 06:27:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:20,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,703 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-02 06:27:20,704 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1252114584, now seen corresponding path program 1 times [2018-12-02 06:27:20,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,771 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-02 06:27:20,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:20,771 INFO L87 Difference]: Start difference. First operand 594 states and 733 transitions. Second operand 14 states. [2018-12-02 06:27:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:20,874 INFO L93 Difference]: Finished difference Result 620 states and 761 transitions. [2018-12-02 06:27:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:20,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-02 06:27:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:20,875 INFO L225 Difference]: With dead ends: 620 [2018-12-02 06:27:20,875 INFO L226 Difference]: Without dead ends: 596 [2018-12-02 06:27:20,875 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-02 06:27:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-12-02 06:27:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2018-12-02 06:27:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-02 06:27:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 729 transitions. [2018-12-02 06:27:20,897 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 729 transitions. Word has length 77 [2018-12-02 06:27:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:20,897 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 729 transitions. [2018-12-02 06:27:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 729 transitions. [2018-12-02 06:27:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 06:27:20,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:20,898 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-02 06:27:20,898 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:20,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1353976224, now seen corresponding path program 1 times [2018-12-02 06:27:20,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:20,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:20,966 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-02 06:27:20,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:20,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:20,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:20,967 INFO L87 Difference]: Start difference. First operand 592 states and 729 transitions. Second operand 14 states. [2018-12-02 06:27:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:21,071 INFO L93 Difference]: Finished difference Result 651 states and 791 transitions. [2018-12-02 06:27:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:21,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-02 06:27:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:21,073 INFO L225 Difference]: With dead ends: 651 [2018-12-02 06:27:21,073 INFO L226 Difference]: Without dead ends: 580 [2018-12-02 06:27:21,073 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-02 06:27:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-02 06:27:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2018-12-02 06:27:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-02 06:27:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 710 transitions. [2018-12-02 06:27:21,099 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 710 transitions. Word has length 72 [2018-12-02 06:27:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:21,099 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 710 transitions. [2018-12-02 06:27:21,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 710 transitions. [2018-12-02 06:27:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 06:27:21,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:21,100 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-02 06:27:21,100 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:21,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1474885070, now seen corresponding path program 1 times [2018-12-02 06:27:21,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:21,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:21,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:21,200 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-02 06:27:21,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:21,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:21,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:21,201 INFO L87 Difference]: Start difference. First operand 580 states and 710 transitions. Second operand 13 states. [2018-12-02 06:27:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:21,382 INFO L93 Difference]: Finished difference Result 600 states and 731 transitions. [2018-12-02 06:27:21,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:21,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-02 06:27:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:21,383 INFO L225 Difference]: With dead ends: 600 [2018-12-02 06:27:21,383 INFO L226 Difference]: Without dead ends: 578 [2018-12-02 06:27:21,384 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-02 06:27:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-02 06:27:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-12-02 06:27:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-02 06:27:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 706 transitions. [2018-12-02 06:27:21,405 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 706 transitions. Word has length 72 [2018-12-02 06:27:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:21,405 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 706 transitions. [2018-12-02 06:27:21,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 706 transitions. [2018-12-02 06:27:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:27:21,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:21,406 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-02 06:27:21,406 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:21,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1301117145, now seen corresponding path program 1 times [2018-12-02 06:27:21,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:21,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:21,462 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-02 06:27:21,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:21,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:27:21,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:27:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:27:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:27:21,462 INFO L87 Difference]: Start difference. First operand 578 states and 706 transitions. Second operand 10 states. [2018-12-02 06:27:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:22,447 INFO L93 Difference]: Finished difference Result 1141 states and 1396 transitions. [2018-12-02 06:27:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 06:27:22,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-02 06:27:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:22,449 INFO L225 Difference]: With dead ends: 1141 [2018-12-02 06:27:22,449 INFO L226 Difference]: Without dead ends: 996 [2018-12-02 06:27:22,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:27:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2018-12-02 06:27:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 916. [2018-12-02 06:27:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-02 06:27:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1144 transitions. [2018-12-02 06:27:22,499 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1144 transitions. Word has length 73 [2018-12-02 06:27:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:22,500 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1144 transitions. [2018-12-02 06:27:22,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:27:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1144 transitions. [2018-12-02 06:27:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:27:22,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:22,500 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-02 06:27:22,501 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:22,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1980389399, now seen corresponding path program 1 times [2018-12-02 06:27:22,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:22,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:22,533 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-02 06:27:22,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:22,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:22,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:22,534 INFO L87 Difference]: Start difference. First operand 916 states and 1144 transitions. Second operand 6 states. [2018-12-02 06:27:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:22,910 INFO L93 Difference]: Finished difference Result 1143 states and 1393 transitions. [2018-12-02 06:27:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:27:22,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 06:27:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:22,912 INFO L225 Difference]: With dead ends: 1143 [2018-12-02 06:27:22,912 INFO L226 Difference]: Without dead ends: 1038 [2018-12-02 06:27:22,912 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-02 06:27:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-12-02 06:27:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 979. [2018-12-02 06:27:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-12-02 06:27:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1213 transitions. [2018-12-02 06:27:22,954 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1213 transitions. Word has length 73 [2018-12-02 06:27:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:22,954 INFO L480 AbstractCegarLoop]: Abstraction has 979 states and 1213 transitions. [2018-12-02 06:27:22,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1213 transitions. [2018-12-02 06:27:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:27:22,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:22,955 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-02 06:27:22,955 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:22,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1694643791, now seen corresponding path program 1 times [2018-12-02 06:27:22,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:27:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:23,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:23,008 INFO L87 Difference]: Start difference. First operand 979 states and 1213 transitions. Second operand 6 states. [2018-12-02 06:27:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,073 INFO L93 Difference]: Finished difference Result 1339 states and 1684 transitions. [2018-12-02 06:27:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:23,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 06:27:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,074 INFO L225 Difference]: With dead ends: 1339 [2018-12-02 06:27:23,075 INFO L226 Difference]: Without dead ends: 965 [2018-12-02 06:27:23,075 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-02 06:27:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-02 06:27:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2018-12-02 06:27:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-12-02 06:27:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1191 transitions. [2018-12-02 06:27:23,123 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1191 transitions. Word has length 77 [2018-12-02 06:27:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,123 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1191 transitions. [2018-12-02 06:27:23,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1191 transitions. [2018-12-02 06:27:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 06:27:23,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,124 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-02 06:27:23,124 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash -532137541, now seen corresponding path program 1 times [2018-12-02 06:27:23,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:23,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:23,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:23,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,144 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-02 06:27:23,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:23,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:23,145 INFO L87 Difference]: Start difference. First operand 965 states and 1191 transitions. Second operand 5 states. [2018-12-02 06:27:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,192 INFO L93 Difference]: Finished difference Result 1010 states and 1239 transitions. [2018-12-02 06:27:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:23,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 06:27:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,193 INFO L225 Difference]: With dead ends: 1010 [2018-12-02 06:27:23,193 INFO L226 Difference]: Without dead ends: 965 [2018-12-02 06:27:23,194 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-02 06:27:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-02 06:27:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2018-12-02 06:27:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-12-02 06:27:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1189 transitions. [2018-12-02 06:27:23,234 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1189 transitions. Word has length 75 [2018-12-02 06:27:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,234 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1189 transitions. [2018-12-02 06:27:23,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1189 transitions. [2018-12-02 06:27:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 06:27:23,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,235 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-02 06:27:23,235 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -509505287, now seen corresponding path program 1 times [2018-12-02 06:27:23,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:23,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,270 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-02 06:27:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:23,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:23,271 INFO L87 Difference]: Start difference. First operand 965 states and 1189 transitions. Second operand 6 states. [2018-12-02 06:27:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,325 INFO L93 Difference]: Finished difference Result 1006 states and 1231 transitions. [2018-12-02 06:27:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:27:23,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-02 06:27:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,327 INFO L225 Difference]: With dead ends: 1006 [2018-12-02 06:27:23,327 INFO L226 Difference]: Without dead ends: 965 [2018-12-02 06:27:23,327 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-02 06:27:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-02 06:27:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2018-12-02 06:27:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-12-02 06:27:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1187 transitions. [2018-12-02 06:27:23,368 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1187 transitions. Word has length 75 [2018-12-02 06:27:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1187 transitions. [2018-12-02 06:27:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1187 transitions. [2018-12-02 06:27:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 06:27:23,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,369 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-02 06:27:23,369 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978377, now seen corresponding path program 1 times [2018-12-02 06:27:23,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,417 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-02 06:27:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:23,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:23,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:23,418 INFO L87 Difference]: Start difference. First operand 965 states and 1187 transitions. Second operand 11 states. [2018-12-02 06:27:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,498 INFO L93 Difference]: Finished difference Result 987 states and 1210 transitions. [2018-12-02 06:27:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:23,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-02 06:27:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,499 INFO L225 Difference]: With dead ends: 987 [2018-12-02 06:27:23,500 INFO L226 Difference]: Without dead ends: 929 [2018-12-02 06:27:23,500 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-02 06:27:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-12-02 06:27:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-12-02 06:27:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-02 06:27:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1135 transitions. [2018-12-02 06:27:23,551 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1135 transitions. Word has length 75 [2018-12-02 06:27:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,551 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1135 transitions. [2018-12-02 06:27:23,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1135 transitions. [2018-12-02 06:27:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 06:27:23,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,552 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-02 06:27:23,552 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash -235814922, now seen corresponding path program 1 times [2018-12-02 06:27:23,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:23,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,583 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-02 06:27:23,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:27:23,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:27:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:27:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:27:23,584 INFO L87 Difference]: Start difference. First operand 923 states and 1135 transitions. Second operand 5 states. [2018-12-02 06:27:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:23,735 INFO L93 Difference]: Finished difference Result 1283 states and 1606 transitions. [2018-12-02 06:27:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:23,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-02 06:27:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:23,736 INFO L225 Difference]: With dead ends: 1283 [2018-12-02 06:27:23,736 INFO L226 Difference]: Without dead ends: 923 [2018-12-02 06:27:23,737 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-02 06:27:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-02 06:27:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-12-02 06:27:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-02 06:27:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1133 transitions. [2018-12-02 06:27:23,776 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1133 transitions. Word has length 81 [2018-12-02 06:27:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:23,776 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1133 transitions. [2018-12-02 06:27:23,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:27:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1133 transitions. [2018-12-02 06:27:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 06:27:23,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:23,777 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-02 06:27:23,777 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:23,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 450861343, now seen corresponding path program 1 times [2018-12-02 06:27:23,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:23,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:23,822 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-02 06:27:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:23,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:27:23,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:27:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:27:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:27:23,823 INFO L87 Difference]: Start difference. First operand 923 states and 1133 transitions. Second operand 10 states. [2018-12-02 06:27:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:24,648 INFO L93 Difference]: Finished difference Result 988 states and 1198 transitions. [2018-12-02 06:27:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:24,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-02 06:27:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:24,650 INFO L225 Difference]: With dead ends: 988 [2018-12-02 06:27:24,650 INFO L226 Difference]: Without dead ends: 855 [2018-12-02 06:27:24,650 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-02 06:27:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-02 06:27:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 429. [2018-12-02 06:27:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-12-02 06:27:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 525 transitions. [2018-12-02 06:27:24,675 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 525 transitions. Word has length 78 [2018-12-02 06:27:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 525 transitions. [2018-12-02 06:27:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:27:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 525 transitions. [2018-12-02 06:27:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 06:27:24,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:24,676 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-02 06:27:24,676 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:24,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1205519637, now seen corresponding path program 1 times [2018-12-02 06:27:24,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:24,765 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-02 06:27:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:24,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:24,765 INFO L87 Difference]: Start difference. First operand 429 states and 525 transitions. Second operand 13 states. [2018-12-02 06:27:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:24,890 INFO L93 Difference]: Finished difference Result 431 states and 526 transitions. [2018-12-02 06:27:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:24,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-12-02 06:27:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:24,891 INFO L225 Difference]: With dead ends: 431 [2018-12-02 06:27:24,891 INFO L226 Difference]: Without dead ends: 367 [2018-12-02 06:27:24,891 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-02 06:27:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-02 06:27:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-12-02 06:27:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-02 06:27:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 457 transitions. [2018-12-02 06:27:24,911 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 457 transitions. Word has length 79 [2018-12-02 06:27:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:24,911 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 457 transitions. [2018-12-02 06:27:24,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 457 transitions. [2018-12-02 06:27:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 06:27:24,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:24,912 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-02 06:27:24,912 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:24,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922871, now seen corresponding path program 1 times [2018-12-02 06:27:24,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:24,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:24,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:24,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:24,928 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-02 06:27:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:24,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:24,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:24,929 INFO L87 Difference]: Start difference. First operand 367 states and 457 transitions. Second operand 3 states. [2018-12-02 06:27:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:24,952 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2018-12-02 06:27:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:24,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-02 06:27:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:24,953 INFO L225 Difference]: With dead ends: 410 [2018-12-02 06:27:24,953 INFO L226 Difference]: Without dead ends: 372 [2018-12-02 06:27:24,954 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-02 06:27:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-02 06:27:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2018-12-02 06:27:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-02 06:27:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2018-12-02 06:27:24,975 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 80 [2018-12-02 06:27:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2018-12-02 06:27:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2018-12-02 06:27:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 06:27:24,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:24,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] [2018-12-02 06:27:24,976 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:24,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash 327061127, now seen corresponding path program 1 times [2018-12-02 06:27:24,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:25,055 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-02 06:27:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:25,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 06:27:25,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 06:27:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:27:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:27:25,056 INFO L87 Difference]: Start difference. First operand 368 states and 458 transitions. Second operand 14 states. [2018-12-02 06:27:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:25,148 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-12-02 06:27:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:27:25,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-12-02 06:27:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:25,149 INFO L225 Difference]: With dead ends: 383 [2018-12-02 06:27:25,149 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 06:27:25,149 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-02 06:27:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 06:27:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-12-02 06:27:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-02 06:27:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2018-12-02 06:27:25,168 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 80 [2018-12-02 06:27:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:25,168 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2018-12-02 06:27:25,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 06:27:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2018-12-02 06:27:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 06:27:25,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:25,168 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-02 06:27:25,168 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:25,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 121497713, now seen corresponding path program 1 times [2018-12-02 06:27:25,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:25,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:25,211 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-02 06:27:25,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:25,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:27:25,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:27:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:27:25,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:27:25,212 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 6 states. [2018-12-02 06:27:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:25,339 INFO L93 Difference]: Finished difference Result 445 states and 546 transitions. [2018-12-02 06:27:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:27:25,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-02 06:27:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:25,340 INFO L225 Difference]: With dead ends: 445 [2018-12-02 06:27:25,340 INFO L226 Difference]: Without dead ends: 303 [2018-12-02 06:27:25,340 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-02 06:27:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-02 06:27:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 257. [2018-12-02 06:27:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 06:27:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2018-12-02 06:27:25,355 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 83 [2018-12-02 06:27:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:25,355 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2018-12-02 06:27:25,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:27:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2018-12-02 06:27:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 06:27:25,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:25,355 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-02 06:27:25,355 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:25,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1235629862, now seen corresponding path program 1 times [2018-12-02 06:27:25,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:25,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:25,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:25,422 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-02 06:27:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:27:25,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:27:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:27:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:27:25,423 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand 13 states. [2018-12-02 06:27:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:25,873 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-12-02 06:27:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:27:25,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-12-02 06:27:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:25,874 INFO L225 Difference]: With dead ends: 289 [2018-12-02 06:27:25,874 INFO L226 Difference]: Without dead ends: 266 [2018-12-02 06:27:25,874 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-02 06:27:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-02 06:27:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2018-12-02 06:27:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 06:27:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-12-02 06:27:25,892 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 99 [2018-12-02 06:27:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:25,892 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-12-02 06:27:25,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:27:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-12-02 06:27:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 06:27:25,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:25,893 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:25,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -642637310, now seen corresponding path program 1 times [2018-12-02 06:27:25,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:25,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:25,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:25,951 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-02 06:27:25,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:27:25,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:27:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:27:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:27:25,952 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 10 states. [2018-12-02 06:27:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:26,544 INFO L93 Difference]: Finished difference Result 551 states and 641 transitions. [2018-12-02 06:27:26,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 06:27:26,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-12-02 06:27:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:26,545 INFO L225 Difference]: With dead ends: 551 [2018-12-02 06:27:26,545 INFO L226 Difference]: Without dead ends: 492 [2018-12-02 06:27:26,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-12-02 06:27:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-02 06:27:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 448. [2018-12-02 06:27:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-02 06:27:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 522 transitions. [2018-12-02 06:27:26,568 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 522 transitions. Word has length 101 [2018-12-02 06:27:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:26,568 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 522 transitions. [2018-12-02 06:27:26,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:27:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 522 transitions. [2018-12-02 06:27:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 06:27:26,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:26,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 06:27:26,569 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:26,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1234425920, now seen corresponding path program 1 times [2018-12-02 06:27:26,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:26,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:26,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:26,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:26,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:26,604 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-02 06:27:26,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:26,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:27:26,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:27:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:27:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:27:26,605 INFO L87 Difference]: Start difference. First operand 448 states and 522 transitions. Second operand 8 states. [2018-12-02 06:27:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:26,652 INFO L93 Difference]: Finished difference Result 466 states and 541 transitions. [2018-12-02 06:27:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:27:26,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-02 06:27:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:26,652 INFO L225 Difference]: With dead ends: 466 [2018-12-02 06:27:26,652 INFO L226 Difference]: Without dead ends: 407 [2018-12-02 06:27:26,653 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-02 06:27:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-02 06:27:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 219. [2018-12-02 06:27:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-02 06:27:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 251 transitions. [2018-12-02 06:27:26,667 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 251 transitions. Word has length 101 [2018-12-02 06:27:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:26,667 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 251 transitions. [2018-12-02 06:27:26,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:27:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 251 transitions. [2018-12-02 06:27:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 06:27:26,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:26,667 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:27:26,667 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:26,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash 31808508, now seen corresponding path program 1 times [2018-12-02 06:27:26,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:26,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:26,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:26,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:26,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:26,694 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-02 06:27:26,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:27:26,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:27:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:26,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:27:26,803 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-02 06:27:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:27:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 06:27:26,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:27:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:27:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:27:26,820 INFO L87 Difference]: Start difference. First operand 219 states and 251 transitions. Second operand 8 states. [2018-12-02 06:27:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:26,972 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2018-12-02 06:27:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:27:26,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-12-02 06:27:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:26,973 INFO L225 Difference]: With dead ends: 290 [2018-12-02 06:27:26,973 INFO L226 Difference]: Without dead ends: 161 [2018-12-02 06:27:26,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-02 06:27:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-12-02 06:27:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 06:27:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2018-12-02 06:27:26,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 114 [2018-12-02 06:27:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:26,991 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2018-12-02 06:27:26,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:27:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2018-12-02 06:27:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 06:27:26,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:26,992 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-02 06:27:26,992 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:26,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -906281704, now seen corresponding path program 1 times [2018-12-02 06:27:26,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:26,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:26,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:26,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:26,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:27,051 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-02 06:27:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:27,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:27,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:27,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:27,052 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 11 states. [2018-12-02 06:27:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:27,354 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-12-02 06:27:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:27:27,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-02 06:27:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:27,355 INFO L225 Difference]: With dead ends: 169 [2018-12-02 06:27:27,355 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 06:27:27,355 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-02 06:27:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 06:27:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-02 06:27:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-02 06:27:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-12-02 06:27:27,370 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-12-02 06:27:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:27,370 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-12-02 06:27:27,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-12-02 06:27:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 06:27:27,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:27,371 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-02 06:27:27,371 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:27,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1647320713, now seen corresponding path program 1 times [2018-12-02 06:27:27,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:27,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:27,415 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-02 06:27:27,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:27,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:27:27,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:27:27,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:27:27,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:27:27,416 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-12-02 06:27:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:27,737 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-12-02 06:27:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:27:27,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-12-02 06:27:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:27,738 INFO L225 Difference]: With dead ends: 280 [2018-12-02 06:27:27,738 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 06:27:27,739 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-02 06:27:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 06:27:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-02 06:27:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-02 06:27:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-12-02 06:27:27,752 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-12-02 06:27:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:27,752 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-12-02 06:27:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:27:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-12-02 06:27:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 06:27:27,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:27,752 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-02 06:27:27,753 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:27,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1528879239, now seen corresponding path program 1 times [2018-12-02 06:27:27,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:27,771 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-02 06:27:27,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:27,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:27,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:27,771 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-12-02 06:27:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:27,794 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-12-02 06:27:27,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:27,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-02 06:27:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:27,796 INFO L225 Difference]: With dead ends: 192 [2018-12-02 06:27:27,796 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 06:27:27,796 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-02 06:27:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 06:27:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-12-02 06:27:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 06:27:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-12-02 06:27:27,818 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-12-02 06:27:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:27,818 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-12-02 06:27:27,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-12-02 06:27:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 06:27:27,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:27,819 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-02 06:27:27,819 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:27,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1306094136, now seen corresponding path program 1 times [2018-12-02 06:27:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:27,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:27,845 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-02 06:27:27,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:27,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:27:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:27:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:27:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:27:27,846 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 3 states. [2018-12-02 06:27:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:27,872 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-12-02 06:27:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:27:27,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-02 06:27:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:27,873 INFO L225 Difference]: With dead ends: 191 [2018-12-02 06:27:27,873 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 06:27:27,873 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-02 06:27:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 06:27:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-12-02 06:27:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 06:27:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-12-02 06:27:27,894 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 116 [2018-12-02 06:27:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:27,895 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-12-02 06:27:27,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:27:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-12-02 06:27:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 06:27:27,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:27:27,895 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-02 06:27:27,896 INFO L423 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:27:27,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:27:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash -142675845, now seen corresponding path program 1 times [2018-12-02 06:27:27,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:27:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:27:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:27:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:27:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:27:27,960 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-02 06:27:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:27:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:27:27,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:27:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:27:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:27:27,961 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 11 states. [2018-12-02 06:27:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:27:28,254 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-12-02 06:27:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:27:28,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-12-02 06:27:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:27:28,255 INFO L225 Difference]: With dead ends: 152 [2018-12-02 06:27:28,255 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 06:27:28,255 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-02 06:27:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 06:27:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 06:27:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 06:27:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 06:27:28,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-12-02 06:27:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:27:28,256 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:27:28,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:27:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:27:28,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 06:27:28,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 06:27:28,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:28,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:27:29,801 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 1 [2018-12-02 06:27:30,172 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 61 [2018-12-02 06:27:30,335 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-02 06:27:30,456 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2018-12-02 06:27:30,806 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 93 [2018-12-02 06:27:31,038 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-02 06:27:31,359 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 91 [2018-12-02 06:27:31,463 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-12-02 06:27:31,978 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 95 [2018-12-02 06:27:32,263 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2018-12-02 06:27:33,714 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2018-12-02 06:27:33,848 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-12-02 06:27:34,130 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2018-12-02 06:27:34,319 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-12-02 06:27:34,601 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-12-02 06:27:34,912 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2018-12-02 06:27:35,834 WARN L180 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 92 [2018-12-02 06:27:35,989 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-12-02 06:27:36,209 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2018-12-02 06:27:36,316 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-02 06:27:36,536 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2018-12-02 06:27:37,016 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 95 [2018-12-02 06:27:37,864 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 91 [2018-12-02 06:27:38,083 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 57 [2018-12-02 06:27:38,571 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 78 [2018-12-02 06:27:39,016 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2018-12-02 06:27:39,432 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2018-12-02 06:27:39,552 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-12-02 06:27:39,670 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-12-02 06:27:40,075 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2018-12-02 06:27:40,389 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2018-12-02 06:27:40,733 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 95 [2018-12-02 06:27:41,047 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-02 06:27:41,509 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2018-12-02 06:27:41,771 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-12-02 06:27:42,043 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-02 06:27:42,807 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2018-12-02 06:27:42,981 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2018-12-02 06:27:43,155 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-12-02 06:27:43,320 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2018-12-02 06:27:43,528 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2018-12-02 06:27:43,691 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 82 [2018-12-02 06:27:43,862 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-12-02 06:27:44,654 WARN L180 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2018-12-02 06:27:45,035 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 1 [2018-12-02 06:27:45,245 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2018-12-02 06:27:46,095 WARN L180 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 91 [2018-12-02 06:27:46,217 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-12-02 06:27:46,568 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2018-12-02 06:27:47,310 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 95 [2018-12-02 06:27:47,438 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-12-02 06:27:48,785 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 191 DAG size of output: 91 [2018-12-02 06:27:48,973 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-12-02 06:27:49,238 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-12-02 06:27:49,374 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2018-12-02 06:27:49,712 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2018-12-02 06:27:49,947 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2018-12-02 06:27:50,103 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-12-02 06:27:50,332 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-12-02 06:27:50,914 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 70 [2018-12-02 06:27:51,173 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2018-12-02 06:27:51,610 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2018-12-02 06:27:51,776 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-12-02 06:27:52,073 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 82 [2018-12-02 06:27:52,340 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2018-12-02 06:27:52,947 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 82 [2018-12-02 06:27:53,092 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 1 [2018-12-02 06:27:53,297 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2018-12-02 06:27:54,329 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 170 DAG size of output: 90 [2018-12-02 06:27:54,809 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 73 [2018-12-02 06:27:55,496 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 82 [2018-12-02 06:27:55,650 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-02 06:27:55,901 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2018-12-02 06:27:56,317 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-12-02 06:27:56,551 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 78 [2018-12-02 06:27:57,086 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-12-02 06:27:57,246 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2018-12-02 06:27:57,349 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-02 06:27:57,755 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2018-12-02 06:27:58,397 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2018-12-02 06:27:58,534 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-12-02 06:27:58,692 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-12-02 06:27:59,146 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2018-12-02 06:27:59,251 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 1 [2018-12-02 06:27:59,818 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 84 [2018-12-02 06:28:00,051 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2018-12-02 06:28:01,085 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2018-12-02 06:28:01,279 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-12-02 06:28:01,451 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2018-12-02 06:28:01,600 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-02 06:28:01,603 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-12-02 06:28:01,604 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 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0)) (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5) (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5))))) [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-12-02 06:28:01,604 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) 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 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (= |old(~s~0)| ~s~0))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) .cse6) (or (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0)) (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5) .cse6))) [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-12-02 06:28:01,604 INFO L448 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-12-02 06:28:01,605 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)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~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(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L444 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 .cse1 .cse2 .cse3 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse4 .cse5 .cse6)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) .cse6))) [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse9 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse0 (<= .cse9 0)) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse0) (or .cse1 .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5 .cse6 .cse7)) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 (and (or (< 0 .cse9) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse0 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or .cse1 .cse2 .cse3 .cse4 .cse5 (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse6 .cse8 .cse7)))) [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-12-02 06:28:01,605 INFO L448 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L444 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse0 (< 0 .cse9))) (let ((.cse1 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or .cse0 .cse1) (or .cse1 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))))))) [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-12-02 06:28:01,606 INFO L444 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~myStatus~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)))) [2018-12-02 06:28:01,607 INFO L444 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) [2018-12-02 06:28:01,607 INFO L448 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-12-02 06:28:01,607 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-02 06:28:01,607 INFO L444 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse0) (or .cse1 .cse0))))) [2018-12-02 06:28:01,607 INFO L444 ceAbstractionStarter]: At program point L171-2(lines 171 188) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) .cse0) (or .cse1 .cse0))))) [2018-12-02 06:28:01,607 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(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,607 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-12-02 06:28:01,607 INFO L448 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L444 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 .cse8 .cse5 .cse7) (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,608 INFO L444 ceAbstractionStarter]: At program point L1754(line 1754) 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)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-12-02 06:28:01,608 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)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,608 INFO L444 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 .cse8 .cse5 .cse7) (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-12-02 06:28:01,608 INFO L448 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-12-02 06:28:01,609 INFO L444 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse2 (= ~lowerDriverReturn~0 main_~status~9)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (and (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse3 .cse4 (and .cse1 .cse2)) (and (and .cse3 .cse4 .cse1) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~9)) (and (<= ~s~0 ~DC~0) (<= (+ ~DC~0 5) ~IPC~0) .cse0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,609 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) 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)|)) (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)|) (= |old(~customIrp~0)| ~customIrp~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(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,609 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-12-02 06:28:01,609 INFO L444 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-02 06:28:01,609 INFO L444 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse0 (= 0 main_~status~9)) (.cse3 (= ~IPC~0 ~s~0)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse4 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse5 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse7 .cse1 .cse2 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse5 .cse6 .cse4 .cse7 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse6 (and .cse5 .cse7 .cse2))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-02 06:28:01,609 INFO L448 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-12-02 06:28:01,609 INFO L444 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= 0 main_~status~9)) (.cse1 (and .cse7 (= 0 ~pended~0))) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse9 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3) (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)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse5 .cse2 .cse6 .cse3) (and .cse4 .cse7 (= ~routine~0 0) .cse8 .cse5 .cse6 .cse3 (<= 1 ~compRegistered~0) .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (and .cse4 .cse1 .cse6) (<= (+ ~DC~0 5) ~IPC~0) .cse5)) (not (= 0 |old(~pended~0)|)) (and .cse4 .cse1 .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse0 .cse1 .cse3 .cse9) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,609 INFO L448 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-12-02 06:28:01,609 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) 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(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-12-02 06:28:01,610 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)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-12-02 06:28:01,610 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)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L451 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-12-02 06:28:01,610 INFO L448 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-12-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-12-02 06:28:01,611 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)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,611 INFO L444 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0))) [2018-12-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-12-02 06:28:01,611 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0))) [2018-12-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-12-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-12-02 06:28:01,611 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-02 06:28:01,611 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-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-12-02 06:28:01,611 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-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-12-02 06:28:01,611 INFO L448 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-12-02 06:28:01,612 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-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-12-02 06:28:01,612 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-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-12-02 06:28:01,612 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-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-12-02 06:28:01,612 INFO L448 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-12-02 06:28:01,612 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-02 06:28:01,612 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-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-12-02 06:28:01,613 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-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L448 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-12-02 06:28:01,613 INFO L444 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 0 .cse20)) (.cse12 (< .cse20 0)) (.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse15 (not (= ~myStatus~0 0))) (.cse13 (not (= 0 ~pended~0))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse14 (< ~compRegistered~0 1)) (.cse8 (not (= 1 ~routine~0))) (.cse2 (not (= |old(~customIrp~0)| 0))) (.cse0 (let ((.cse18 (or .cse6 .cse9 (not (= ~compRegistered~0 0)))) (.cse19 (not (= 0 ~routine~0)))) (and (or .cse17 .cse4 .cse7 .cse18 .cse19 .cse10 .cse11 .cse12 .cse13) (or .cse17 .cse18 .cse19 .cse10 .cse11 .cse15 .cse13 .cse7))))) (and (or .cse0 .cse1 .cse2) (or (and .cse1 (and (= 1 ~setEventCalled~0) (= ~s~0 |old(~s~0)|))) (let ((.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) .cse2) (or (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse16 (or .cse3 .cse17 .cse10 .cse11 .cse7 (or .cse6 .cse13 .cse14 .cse8)))) (and (or .cse4 .cse12 .cse16) (or .cse15 .cse16)))) .cse2) (or (= |old(~s~0)| ~s~0) .cse0))))) [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L444 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse21)) (.cse3 (< .cse21 0)) (.cse7 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= ~myStatus~0 0))) (.cse12 (not (= 0 ~pended~0))) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse6 (not (= |old(~setEventCalled~0)| 1))) (.cse14 (not (= 1 ~routine~0))) (.cse13 (< ~compRegistered~0 1)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse16 (let ((.cse19 (or .cse11 .cse18 (not (= ~compRegistered~0 0)))) (.cse20 (not (= 0 ~routine~0)))) (and (or .cse7 .cse2 .cse10 .cse19 .cse20 .cse8 .cse9 .cse3 .cse12) (or .cse7 .cse19 .cse20 .cse8 .cse9 .cse5 .cse12 .cse10)))) (.cse15 (not (= |old(~customIrp~0)| 0)))) (and (or (and .cse0 .cse1) (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse4 (or .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse12 .cse13 .cse14)))) (and (or .cse2 .cse3 .cse4) (or .cse5 .cse4)))) .cse15) (or .cse0 .cse16) (or (and (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse1) (let ((.cse17 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse6 .cse2 .cse17 .cse11 .cse10 .cse14 .cse18 .cse8 .cse9 .cse3 .cse12 .cse13) (or .cse6 .cse5 .cse17 .cse11 .cse10 .cse14 .cse18 .cse8 .cse9 .cse12 .cse13))) .cse15) (or .cse1 .cse16 .cse15))))) [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L444 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse21)) (.cse3 (< .cse21 0)) (.cse7 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse5 (not (= ~myStatus~0 0))) (.cse12 (not (= 0 ~pended~0))) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse6 (not (= |old(~setEventCalled~0)| 1))) (.cse14 (not (= 1 ~routine~0))) (.cse13 (< ~compRegistered~0 1)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse16 (let ((.cse19 (or .cse11 .cse18 (not (= ~compRegistered~0 0)))) (.cse20 (not (= 0 ~routine~0)))) (and (or .cse7 .cse2 .cse10 .cse19 .cse20 .cse8 .cse9 .cse3 .cse12) (or .cse7 .cse19 .cse20 .cse8 .cse9 .cse5 .cse12 .cse10)))) (.cse15 (not (= |old(~customIrp~0)| 0)))) (and (or (and .cse0 .cse1) (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse4 (or .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse12 .cse13 .cse14)))) (and (or .cse2 .cse3 .cse4) (or .cse5 .cse4)))) .cse15) (or .cse0 .cse16) (or (and (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)) .cse1) (let ((.cse17 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse6 .cse2 .cse17 .cse11 .cse10 .cse14 .cse18 .cse8 .cse9 .cse3 .cse12 .cse13) (or .cse6 .cse5 .cse17 .cse11 .cse10 .cse14 .cse18 .cse8 .cse9 .cse12 .cse13))) .cse15) (or .cse1 .cse16 .cse15))))) [2018-12-02 06:28:01,614 INFO L444 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse1 (or .cse11 .cse13 (not (= ~compRegistered~0 0)))) (.cse2 (not (= 0 ~routine~0))) (.cse9 (< 0 .cse18)) (.cse14 (< .cse18 0)) (.cse5 (not (= ~myStatus~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~pended~0))) (.cse15 (< ~compRegistered~0 1)) (.cse12 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse7 .cse12 .cse13 .cse3 .cse4 .cse14 .cse6 .cse15) (or .cse8 .cse5 .cse10 .cse11 .cse7 .cse12 .cse13 .cse3 .cse4 .cse6 .cse15))) .cse16) (or .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6) (or (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse17 (or .cse8 .cse0 .cse3 .cse4 .cse7 (or .cse11 .cse6 .cse15 .cse12)))) (and (or .cse9 .cse14 .cse17) (or .cse5 .cse17)))) .cse16)))) [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-12-02 06:28:01,614 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-12-02 06:28:01,615 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse22)) (.cse4 (< .cse22 0)) (.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (not (= ~myStatus~0 0))) (.cse13 (not (= 0 ~pended~0))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse19 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (= |old(~s~0)| ~s~0)) (.cse17 (let ((.cse20 (or .cse12 .cse19 (not (= ~compRegistered~0 0)))) (.cse21 (not (= 0 ~routine~0)))) (and (or .cse8 .cse3 .cse11 .cse20 .cse21 .cse9 .cse10 .cse4 .cse13) (or .cse8 .cse20 .cse21 .cse9 .cse10 .cse6 .cse13 .cse11)))) (.cse1 (= 1 ~setEventCalled~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse15 (not (= 1 ~routine~0))) (.cse14 (< ~compRegistered~0 1)) (.cse16 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and .cse0 .cse1) .cse2) (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse5 (or .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 .cse13 .cse14 .cse15)))) (and (or .cse3 .cse4 .cse5) (or .cse6 .cse5)))) .cse16) (or .cse17 .cse0) (or .cse2 .cse17 .cse16) (or (and (and .cse1 (= ~s~0 |old(~s~0)|)) .cse2) (let ((.cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse7 .cse3 .cse18 .cse12 .cse11 .cse15 .cse19 .cse9 .cse10 .cse4 .cse13 .cse14) (or .cse7 .cse6 .cse18 .cse12 .cse11 .cse15 .cse19 .cse9 .cse10 .cse13 .cse14))) .cse16))))) [2018-12-02 06:28:01,615 INFO L444 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse13 ~SKIP2~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-02 06:28:01,615 INFO L448 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-12-02 06:28:01,615 INFO L444 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-12-02 06:28:01,615 INFO L448 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-12-02 06:28:01,615 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,615 INFO L444 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-12-02 06:28:01,615 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-12-02 06:28:01,615 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-12-02 06:28:01,615 INFO L448 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L444 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (= ~s~0 |old(~s~0)|)) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L444 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-12-02 06:28:01,616 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-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-12-02 06:28:01,616 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-02 06:28:01,616 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-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-12-02 06:28:01,616 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (= 0 ~pended~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse10) .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L444 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~compRegistered~0 1))) [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L444 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse9) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-12-02 06:28:01,617 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (= |old(~customIrp~0)| ~customIrp~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 (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,617 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L444 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (and (and (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-12-02 06:28:01,618 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,623 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-12-02 06:28:01,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-12-02 06:28:01,623 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-12-02 06:28:01,624 INFO L444 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,624 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,624 INFO L444 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,624 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L444 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse11 (+ ~SKIP2~0 3)) (.cse13 (+ ~DC~0 2)) (.cse15 (+ ~NP~0 2)) (.cse14 (+ ~NP~0 5)) (.cse12 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= .cse11 ~IPC~0) (<= .cse13 ~SKIP2~0) (and (<= .cse15 ~SKIP1~0) (= 0 ~pended~0) (<= .cse14 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse12 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1))))) (or (and (<= 0 |old(~myStatus~0)|) (= 0 CdAudioPnp_~status~2) .cse0) (let ((.cse1 (< ~SKIP1~0 .cse15)) (.cse2 (< ~MPR3~0 .cse14)) (.cse4 (< ~SKIP2~0 .cse13)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse12)) (.cse8 (< ~IPC~0 .cse11)) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and .cse0 (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,631 INFO L448 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-12-02 06:28:01,631 INFO L444 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0)) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (<= 0 ~myStatus~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,631 INFO L444 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,632 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= 1 ~setEventCalled~0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,634 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L444 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (not (= |old(~customIrp~0)| 0))) [2018-12-02 06:28:01,635 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L451 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-12-02 06:28:01,635 INFO L444 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,642 INFO L448 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-12-02 06:28:01,642 INFO L444 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,642 INFO L448 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-12-02 06:28:01,642 INFO L444 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,642 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-12-02 06:28:01,642 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-12-02 06:28:01,642 INFO L448 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-12-02 06:28:01,642 INFO L444 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,642 INFO L444 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L444 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,646 INFO L444 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-02 06:28:01,646 INFO L444 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-12-02 06:28:01,646 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-12-02 06:28:01,647 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L444 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (<= .cse0 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L444 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-12-02 06:28:01,652 INFO L444 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,659 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L444 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse10) (<= .cse10 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))))) [2018-12-02 06:28:01,660 INFO L448 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L448 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L444 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,660 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L448 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-12-02 06:28:01,660 INFO L444 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= .cse10 0) (and (and (<= 0 .cse10) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (= |old(~myStatus~0)| ~myStatus~0))))) [2018-12-02 06:28:01,660 INFO L444 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,666 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-12-02 06:28:01,666 INFO L448 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L444 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L444 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse0) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-02 06:28:01,667 INFO L448 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-12-02 06:28:01,667 INFO L444 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-12-02 06:28:01,677 INFO L444 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,677 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-12-02 06:28:01,678 INFO L444 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,678 INFO L448 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-12-02 06:28:01,678 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-12-02 06:28:01,687 INFO L444 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-12-02 06:28:01,688 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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse10) (<= .cse10 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))))) [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L444 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L448 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-12-02 06:28:01,688 INFO L444 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-12-02 06:28:01,692 INFO L444 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-12-02 06:28:01,692 INFO L448 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-12-02 06:28:01,692 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-12-02 06:28:01,692 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-12-02 06:28:01,692 INFO L448 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-12-02 06:28:01,692 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-12-02 06:28:01,692 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< 0 .cse19)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (and .cse0 (= |old(~s~0)| ~s~0))) (.cse6 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse19 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse6 .cse15 .cse7 .cse8 .cse16 .cse11 .cse17) (or (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse18 .cse15 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse18 .cse15 .cse7 .cse8 .cse13 .cse11 .cse17))) (and .cse0 (= ~s~0 |old(~s~0)|)) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse16 .cse6 .cse15 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-12-02 06:28:01,697 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-12-02 06:28:01,697 INFO L448 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-12-02 06:28:01,697 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-12-02 06:28:01,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-12-02 06:28:01,698 INFO L444 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-12-02 06:28:01,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-12-02 06:28:01,698 INFO L448 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-12-02 06:28:01,698 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-12-02 06:28:01,698 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-12-02 06:28:01,703 INFO L444 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse10 (< 0 .cse17)) (.cse11 (< .cse17 0)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~SKIP1~0 |old(~s~0)|)) (.cse15 (< |old(~s~0)| ~SKIP1~0)) (.cse16 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (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 (= 0 |old(~pended~0)|))) (.cse9 (< ~compRegistered~0 1))) (and (or (let ((.cse4 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9))) (not (= ~customIrp~0 0))) (or .cse0 .cse10 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse13 .cse0 .cse10 .cse3 .cse14 .cse12 .cse6 .cse7 .cse11 .cse15 .cse16 .cse8) (or .cse13 .cse0 .cse1 .cse3 .cse14 .cse12 .cse6 .cse7 .cse15 .cse16 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,703 INFO L448 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-12-02 06:28:01,703 INFO L444 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse10 (< 0 .cse18)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< .cse18 0)) (.cse9 (< ~compRegistered~0 1)) (.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse12 (not (= 0 ~routine~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or (let ((.cse4 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9))) (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9) (or .cse14 .cse0 .cse10 .cse3 .cse15 .cse12 .cse6 .cse7 .cse11 .cse16 .cse17 .cse8) (or .cse0 .cse10 .cse2 .cse3 .cse13 .cse12 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse12 .cse6 .cse7 .cse16 .cse17 .cse8)))) [2018-12-02 06:28:01,703 INFO L448 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-12-02 06:28:01,703 INFO L444 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-12-02 06:28:01,710 INFO L444 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse4 (not (= 0 ~routine~0))) (.cse15 (not (= ~myStatus~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 0 .cse19)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (< .cse19 0)) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9) (or .cse11 .cse0 .cse15 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (or (let ((.cse16 (not (= 1 ~routine~0)))) (and (or .cse0 .cse15 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse18 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse17 0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse17) (<= .cse18 0) (= 1 ~setEventCalled~0) (<= 0 .cse18))) (not (= ~customIrp~0 0)))))) [2018-12-02 06:28:01,711 INFO L444 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse17)) (.cse8 (< .cse17 0)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9) (or (let ((.cse16 (not (= 1 ~routine~0)))) (and (or .cse0 .cse15 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (= ~customIrp~0 0))) (or .cse11 .cse0 .cse15 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2018-12-02 06:28:01,722 INFO L448 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-12-02 06:28:01,723 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-02 06:28:01,723 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-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-02 06:28:01,723 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-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 06:28:01,723 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)|) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-02 06:28:01,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L444 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (and (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L444 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L444 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L444 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-12-02 06:28:01,732 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-12-02 06:28:01,733 INFO L444 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,737 INFO L444 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,737 INFO L448 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-12-02 06:28:01,737 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-12-02 06:28:01,737 INFO L448 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-12-02 06:28:01,738 INFO L448 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-12-02 06:28:01,738 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-12-02 06:28:01,738 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-12-02 06:28:01,738 INFO L444 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse14 (+ ~NP~0 5))) (let ((.cse0 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse2 (= ~IPC~0 ~s~0)) (.cse3 (and (= 0 ~pended~0) (<= .cse14 ~MPR3~0))) (.cse1 (= ~routine~0 0))) (or (and .cse0 .cse1 (<= 1 ~compRegistered~0) .cse2) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse3 .cse1 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 .cse14)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse6 (+ |old(~myStatus~0)| 1073741637))) (or .cse4 .cse5 (< 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse6 0) .cse12 .cse13)) (or .cse4 .cse5 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) (and .cse3 .cse0 .cse1 .cse2) (and (not (= 259 CdAudioDeviceControl_~status~3)) (and (= ~DC~0 ~s~0) (and .cse3 .cse1)))))) [2018-12-02 06:28:01,738 INFO L444 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,743 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-12-02 06:28:01,743 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-12-02 06:28:01,743 INFO L444 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,743 INFO L448 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-12-02 06:28:01,743 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-12-02 06:28:01,743 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,743 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-02 06:28:01,743 INFO L444 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,744 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,755 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-12-02 06:28:01,755 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-12-02 06:28:01,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 06:28:01,755 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0)) [2018-12-02 06:28:01,756 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 06:28:01,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 06:28:01,756 INFO L444 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,756 INFO L448 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-12-02 06:28:01,756 INFO L444 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,756 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L444 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L444 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L444 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse10 0) (<= 0 .cse10) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-12-02 06:28:01,763 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-12-02 06:28:01,770 INFO L444 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,770 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-12-02 06:28:01,770 INFO L444 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-12-02 06:28:01,770 INFO L448 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-12-02 06:28:01,770 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-12-02 06:28:01,771 INFO L444 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,771 INFO L448 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-12-02 06:28:01,771 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-12-02 06:28:01,771 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-12-02 06:28:01,771 INFO L448 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-12-02 06:28:01,771 INFO L444 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0)))) (or (and .cse0 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse2 (< ~MPR3~0 .cse12)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 CdAudio435DeviceControl_~status~6) .cse0)))) [2018-12-02 06:28:01,777 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-12-02 06:28:01,777 INFO L448 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-12-02 06:28:01,777 INFO L444 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,777 INFO L448 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-12-02 06:28:01,777 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-12-02 06:28:01,777 INFO L444 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-12-02 06:28:01,778 INFO L444 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,778 INFO L444 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse12 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 2)) (.cse13 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse12 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0))))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (let ((.cse1 (< ~SKIP1~0 .cse14)) (.cse2 (< ~MPR3~0 .cse13)) (.cse4 (< ~SKIP2~0 .cse12)) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0)))) [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L444 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-12-02 06:28:01,784 INFO L444 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-12-02 06:28:01,784 INFO L444 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-02 06:28:01,794 INFO L444 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L444 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-12-02 06:28:01,794 INFO L444 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L444 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-12-02 06:28:01,805 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-12-02 06:28:01,806 INFO L444 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,814 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-12-02 06:28:01,814 INFO L444 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-12-02 06:28:01,814 INFO L448 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-12-02 06:28:01,814 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-12-02 06:28:01,815 INFO L444 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,815 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-12-02 06:28:01,815 INFO L448 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-12-02 06:28:01,815 INFO L444 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,815 INFO L448 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-12-02 06:28:01,821 INFO L444 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L444 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-12-02 06:28:01,822 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L444 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (and (= 0 ~myStatus~0) (and (let ((.cse0 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (.cse1 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse2 (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (and .cse0 .cse1 .cse2 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) .cse1 .cse2))) (= ~myStatus~0 |old(~myStatus~0)|))) (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (not (= 0 ~routine~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= ~compRegistered~0 0))) (.cse12 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse5 (+ |old(~myStatus~0)| 1073741637))) (or .cse3 .cse4 (< 0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse5 0) .cse11 .cse12)) (or .cse3 .cse4 (not (= |old(~myStatus~0)| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L444 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-12-02 06:28:01,828 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L448 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L448 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L448 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-12-02 06:28:01,829 INFO L444 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L444 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-12-02 06:28:01,832 INFO L448 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-12-02 06:28:01,833 INFO L444 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,833 INFO L448 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-12-02 06:28:01,833 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-12-02 06:28:01,834 INFO L448 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L444 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L444 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-12-02 06:28:01,835 INFO L451 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-12-02 06:28:01,835 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-12-02 06:28:01,843 INFO L448 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-12-02 06:28:01,843 INFO L448 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-12-02 06:28:01,843 INFO L448 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-12-02 06:28:01,843 INFO L448 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-12-02 06:28:01,844 INFO L444 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (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 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 (< .cse2 0) .cse7 .cse8)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2018-12-02 06:28:01,844 INFO L448 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-12-02 06:28:01,844 INFO L448 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-12-02 06:28:01,844 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-12-02 06:28:01,844 INFO L444 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse3 (+ ~myStatus~0 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 (< .cse3 0) .cse8 .cse9)) (or .cse1 .cse2 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or .cse0 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1))) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,844 INFO L448 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-12-02 06:28:01,844 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse3 (+ ~myStatus~0 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 (< .cse3 0) .cse8 .cse9)) (or .cse1 .cse2 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))))) (and (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0))) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,844 INFO L444 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (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 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 (< .cse2 0) .cse7 .cse8)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2018-12-02 06:28:01,854 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-12-02 06:28:01,854 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-12-02 06:28:01,855 INFO L444 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (not (= 0 |old(~pended~0)|))) (.cse14 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (let ((.cse8 (+ ~myStatus~0 1073741637))) (or .cse6 .cse7 (< 0 .cse8) .cse9 .cse10 .cse11 .cse12 (< .cse8 0) .cse13 .cse14)) (or .cse6 .cse7 (not (= ~myStatus~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (and (let ((.cse1 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse5 (= ~routine~0 1)) (.cse4 (= 1 ~setEventCalled~0))) (or .cse0 (and .cse1 .cse2 (= |old(~s~0)| ~s~0) .cse3 .cse4 .cse5) (and (= ~s~0 ~MPR3~0) (and .cse1 .cse2 .cse3 .cse5 .cse4)))) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 (not (= |old(~customIrp~0)| 0))))) [2018-12-02 06:28:01,855 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-12-02 06:28:01,855 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-12-02 06:28:01,855 INFO L451 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-12-02 06:28:01,855 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-12-02 06:28:01,855 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-12-02 06:28:01,855 INFO L448 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-12-02 06:28:01,855 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-12-02 06:28:01,855 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-12-02 06:28:01,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:28:01 BoogieIcfgContainer [2018-12-02 06:28:01,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:28:01,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:28:01,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:28:01,896 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:28:01,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:27:04" (3/4) ... [2018-12-02 06:28:01,899 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-02 06:28:01,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-12-02 06:28:01,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-12-02 06:28:01,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-12-02 06:28:01,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-12-02 06:28:01,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-12-02 06:28:01,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-02 06:28:01,919 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-12-02 06:28:01,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-02 06:28:01,921 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 06:28:01,940 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,941 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,941 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (!(259 == status) && (s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,941 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-12-02 06:28:01,942 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == NP && \old(customIrp) == customIrp) || !(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(\old(customIrp) == 0)) [2018-12-02 06:28:01,942 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == NP && \old(customIrp) == customIrp) || !(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(\old(customIrp) == 0)) [2018-12-02 06:28:01,942 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-02 06:28:01,942 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,942 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-02 06:28:01,942 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-12-02 06:28:01,943 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,943 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s)) || (!(259 == status) && DC == s && (0 == pended && NP + 5 <= MPR3) && routine == 0) [2018-12-02 06:28:01,943 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || \old(customIrp) == customIrp) || !(\old(customIrp) == 0)) && (((\old(customIrp) == customIrp && 1 == setEventCalled && s == \old(s)) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) [2018-12-02 06:28:01,943 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-02 06:28:01,943 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-02 06:28:01,943 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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) || ((((((((((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)) && \old(customIrp) == customIrp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,946 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-12-02 06:28:01,946 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-12-02 06:28:01,955 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:01,955 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,955 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:01,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-12-02 06:28:01,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (s == NP && 0 == pended) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:01,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:01,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-12-02 06:28:01,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) [2018-12-02 06:28:01,976 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && s == NP && 0 == pended) [2018-12-02 06:28:01,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) [2018-12-02 06:28:01,977 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))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) [2018-12-02 06:28:01,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && (0 <= status + 1073741670 && s == NP && 0 == pended) && \old(myStatus) == myStatus) [2018-12-02 06:28:01,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && routine == 0) && s == \old(s)) && \old(myStatus) == myStatus) && 0 <= myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0) [2018-12-02 06:28:01,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s)) || !(\old(customIrp) == 0) [2018-12-02 06:28:02,001 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,001 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,001 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,001 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,002 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-02 06:28:02,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-02 06:28:02,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-02 06:28:02,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) [2018-12-02 06:28:02,032 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,032 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) [2018-12-02 06:28:02,032 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-12-02 06:28:02,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-12-02 06:28:02,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-12-02 06:28:02,148 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1d8dc6f-adfa-4e48-a521-0809167981f0/bin-2019/uautomizer/witness.graphml [2018-12-02 06:28:02,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:28:02,149 INFO L168 Benchmark]: Toolchain (without parser) took 58929.22 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 980.9 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -219.7 MB). Peak memory consumption was 761.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,150 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:28:02,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.28 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-02 06:28:02,150 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,151 INFO L168 Benchmark]: RCFGBuilder took 716.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.4 MB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,151 INFO L168 Benchmark]: TraceAbstraction took 57523.71 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 862.5 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -271.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,151 INFO L168 Benchmark]: Witness Printer took 253.16 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:28:02,152 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.28 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 42.37 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 716.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.4 MB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57523.71 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 862.5 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -271.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 253.16 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1756]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && s == NP && 0 == pended) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (s == NP && 0 == pended) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((((s == NP && \old(customIrp) == customIrp) || !(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((((s == NP && \old(customIrp) == customIrp) || !(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)))) && ((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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) || ((((((((((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)) && \old(customIrp) == customIrp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || \old(customIrp) == customIrp) || !(\old(customIrp) == 0)) && (((\old(customIrp) == customIrp && 1 == setEventCalled && s == \old(s)) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1))) || !(\old(customIrp) == 0))) && ((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (!(259 == status) && (s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && ((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1))) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s)) || (!(259 == status) && DC == s && (0 == pended && NP + 5 <= MPR3) && routine == 0) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && routine == 0) && s == \old(s)) && \old(myStatus) == myStatus) && 0 <= myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 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)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (status + 1073741670 <= 0 && (0 <= status + 1073741670 && s == NP && 0 == pended) && \old(myStatus) == myStatus) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\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))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 534 locations, 1 error locations. SAFE Result, 57.4s OverallTime, 96 OverallIterations, 2 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 33.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 49998 SDtfs, 19128 SDslu, 223764 SDs, 0 SdLazy, 22542 SolverSat, 3293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1083 GetRequests, 329 SyntacticMatches, 8 SemanticMatches, 746 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=979occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 96 MinimizatonAttempts, 2575 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1723 PreInvPairs, 2027 NumberOfFragments, 23597 HoareAnnotationTreeSize, 1723 FomulaSimplifications, 29744319 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1981367 FormulaSimplificationTreeSizeReductionInter, 31.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 6492 NumberOfCodeBlocks, 6492 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 6395 ConstructedInterpolants, 0 QuantifiedInterpolants, 901635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 927 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 97 InterpolantComputations, 95 PerfectInterpolantSequences, 75/89 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...